/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/test-easy10.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:22:24,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:22:25,037 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 23:22:25,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:22:25,041 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:22:25,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:22:25,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:22:25,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:22:25,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:22:25,060 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:22:25,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:22:25,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:22:25,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:22:25,061 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:22:25,061 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:22:25,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:22:25,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:22:25,061 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:22:25,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:22:25,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:22:25,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:22:25,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:22:25,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:22:25,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:22:25,063 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:22:25,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:22:25,063 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:22:25,063 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:22:25,063 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:22:25,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:22:25,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:22:25,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:22:25,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:22:25,064 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:22:25,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:22:25,064 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:22:25,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:22:25,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:22:25,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:22:25,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:22:25,064 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:22:25,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:22:25,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:22:25,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:22:25,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:22:25,064 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:22:25,064 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:22:25,064 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:22:25,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:22:25,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:22:25,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:22:25,294 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:22:25,294 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:22:25,295 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 23:22:26,552 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9e10fc1c/f5f016516bac4111a712ec4d8e51c013/FLAG95d2d3d09 [2025-04-13 23:22:26,753 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:22:26,754 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy10.wvr.c [2025-04-13 23:22:26,765 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9e10fc1c/f5f016516bac4111a712ec4d8e51c013/FLAG95d2d3d09 [2025-04-13 23:22:27,703 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9e10fc1c/f5f016516bac4111a712ec4d8e51c013 [2025-04-13 23:22:27,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:22:27,706 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:22:27,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:22:27,707 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:22:27,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:22:27,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:22:27" (1/1) ... [2025-04-13 23:22:27,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59eab7c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:22:27, skipping insertion in model container [2025-04-13 23:22:27,711 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:22:27" (1/1) ... [2025-04-13 23:22:27,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:22:27,873 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 23:22:27,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:22:27,884 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:22:27,908 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 23:22:27,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:22:27,918 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:22:27,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:22:27 WrapperNode [2025-04-13 23:22:27,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:22:27,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:22:27,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:22:27,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:22:27,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:22:27" (1/1) ... [2025-04-13 23:22:27,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:22:27" (1/1) ... [2025-04-13 23:22:27,959 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2025-04-13 23:22:27,959 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:22:27,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:22:27,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:22:27,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:22:27,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:22:27" (1/1) ... [2025-04-13 23:22:27,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:22:27" (1/1) ... [2025-04-13 23:22:27,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:22:27" (1/1) ... [2025-04-13 23:22:27,977 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 23:22:27,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:22:27" (1/1) ... [2025-04-13 23:22:27,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:22:27" (1/1) ... [2025-04-13 23:22:27,980 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:22:27" (1/1) ... [2025-04-13 23:22:27,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:22:27" (1/1) ... [2025-04-13 23:22:27,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:22:27" (1/1) ... [2025-04-13 23:22:27,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:22:27" (1/1) ... [2025-04-13 23:22:27,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:22:27,985 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:22:27,985 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:22:27,985 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:22:27,986 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:22:27" (1/1) ... [2025-04-13 23:22:27,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:22:28,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:22:28,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 23:22:28,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 23:22:28,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:22:28,029 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 23:22:28,029 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 23:22:28,029 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 23:22:28,029 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 23:22:28,029 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 23:22:28,029 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 23:22:28,029 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 23:22:28,029 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 23:22:28,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:22:28,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:22:28,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:22:28,030 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:22:28,101 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:22:28,103 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:22:28,315 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:22:28,316 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:22:28,316 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:22:28,466 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:22:28,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:22:28 BoogieIcfgContainer [2025-04-13 23:22:28,466 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:22:28,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:22:28,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:22:28,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:22:28,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:22:27" (1/3) ... [2025-04-13 23:22:28,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdceeb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:22:28, skipping insertion in model container [2025-04-13 23:22:28,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:22:27" (2/3) ... [2025-04-13 23:22:28,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdceeb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:22:28, skipping insertion in model container [2025-04-13 23:22:28,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:22:28" (3/3) ... [2025-04-13 23:22:28,474 INFO L128 eAbstractionObserver]: Analyzing ICFG test-easy10.wvr.c [2025-04-13 23:22:28,489 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:22:28,491 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 23:22:28,491 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:22:28,544 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 23:22:28,575 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72 places, 59 transitions, 146 flow [2025-04-13 23:22:29,135 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 23:22:29,155 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:22:29,164 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;@5f0a2877, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:22:29,164 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 23:22:29,203 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 23:22:29,313 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:22:29,313 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:22:29,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 23:22:29,314 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 23:22:29,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:22:29,318 INFO L85 PathProgramCache]: Analyzing trace with hash 864062147, now seen corresponding path program 1 times [2025-04-13 23:22:29,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:22:29,324 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430906868] [2025-04-13 23:22:29,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:22:29,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:22:29,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:22:29,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:22:29,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:22:29,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:22:29,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:22:29,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430906868] [2025-04-13 23:22:29,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430906868] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:22:29,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:22:29,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:22:29,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081023316] [2025-04-13 23:22:29,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:22:29,902 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:22:29,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:22:29,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:22:29,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:22:29,956 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 23:22:30,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:22:30,418 INFO L93 Difference]: Finished difference Result 19647 states and 77103 transitions. [2025-04-13 23:22:30,419 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:22:30,419 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 23:22:30,420 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:22:30,596 INFO L225 Difference]: With dead ends: 19647 [2025-04-13 23:22:30,596 INFO L226 Difference]: Without dead ends: 12679 [2025-04-13 23:22:30,616 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 23:22:30,621 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:22:30,622 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 7 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:22:30,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12679 states. [2025-04-13 23:22:31,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12679 to 12679. [2025-04-13 23:22:31,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12679 states, 12678 states have (on average 3.917810380186149) internal successors, (49670), 12678 states have internal predecessors, (49670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:31,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12679 states to 12679 states and 49670 transitions. [2025-04-13 23:22:31,322 INFO L79 Accepts]: Start accepts. Automaton has 12679 states and 49670 transitions. Word has length 54 [2025-04-13 23:22:31,325 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:22:31,325 INFO L485 AbstractCegarLoop]: Abstraction has 12679 states and 49670 transitions. [2025-04-13 23:22:31,325 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 23:22:31,326 INFO L278 IsEmpty]: Start isEmpty. Operand 12679 states and 49670 transitions. [2025-04-13 23:22:31,441 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:22:31,441 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:22:31,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:22:31,442 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:22:31,442 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 23:22:31,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:22:31,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1746897757, now seen corresponding path program 2 times [2025-04-13 23:22:31,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:22:31,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570766551] [2025-04-13 23:22:31,443 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:22:31,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:22:31,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:22:31,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:22:31,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:22:31,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:22:31,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:22:31,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570766551] [2025-04-13 23:22:31,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570766551] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:22:31,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:22:31,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:22:31,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170464549] [2025-04-13 23:22:31,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:22:31,670 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:22:31,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:22:31,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:22:31,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:22:31,671 INFO L87 Difference]: Start difference. First operand 12679 states and 49670 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 23:22:31,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:22:31,979 INFO L93 Difference]: Finished difference Result 16816 states and 65105 transitions. [2025-04-13 23:22:31,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:22:31,979 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 23:22:31,979 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:22:32,041 INFO L225 Difference]: With dead ends: 16816 [2025-04-13 23:22:32,041 INFO L226 Difference]: Without dead ends: 9435 [2025-04-13 23:22:32,060 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 23:22:32,061 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:22:32,062 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 7 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:22:32,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9435 states. [2025-04-13 23:22:32,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9435 to 9435. [2025-04-13 23:22:32,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9435 states, 9434 states have (on average 3.8293406826372696) internal successors, (36126), 9434 states have internal predecessors, (36126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9435 states to 9435 states and 36126 transitions. [2025-04-13 23:22:32,518 INFO L79 Accepts]: Start accepts. Automaton has 9435 states and 36126 transitions. Word has length 54 [2025-04-13 23:22:32,518 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:22:32,518 INFO L485 AbstractCegarLoop]: Abstraction has 9435 states and 36126 transitions. [2025-04-13 23:22:32,519 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 23:22:32,519 INFO L278 IsEmpty]: Start isEmpty. Operand 9435 states and 36126 transitions. [2025-04-13 23:22:32,542 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:22:32,542 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:22:32,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 23:22:32,543 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:22:32,543 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 23:22:32,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:22:32,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1615523139, now seen corresponding path program 3 times [2025-04-13 23:22:32,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:22:32,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550959474] [2025-04-13 23:22:32,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:22:32,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:22:32,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:22:32,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:22:32,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:22:32,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:22:32,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:22:32,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550959474] [2025-04-13 23:22:32,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550959474] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:22:32,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:22:32,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:22:32,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255529926] [2025-04-13 23:22:32,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:22:32,719 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:22:32,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:22:32,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:22:32,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:22:32,720 INFO L87 Difference]: Start difference. First operand 9435 states and 36126 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 23:22:32,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:22:32,874 INFO L93 Difference]: Finished difference Result 11521 states and 43739 transitions. [2025-04-13 23:22:32,875 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:22:32,875 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 23:22:32,875 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:22:32,944 INFO L225 Difference]: With dead ends: 11521 [2025-04-13 23:22:32,944 INFO L226 Difference]: Without dead ends: 7771 [2025-04-13 23:22:32,957 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 23:22:32,957 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:22:32,958 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 7 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:22:32,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7771 states. [2025-04-13 23:22:33,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7771 to 7771. [2025-04-13 23:22:33,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7771 states, 7770 states have (on average 3.77014157014157) internal successors, (29294), 7770 states have internal predecessors, (29294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:33,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7771 states to 7771 states and 29294 transitions. [2025-04-13 23:22:33,250 INFO L79 Accepts]: Start accepts. Automaton has 7771 states and 29294 transitions. Word has length 54 [2025-04-13 23:22:33,250 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:22:33,250 INFO L485 AbstractCegarLoop]: Abstraction has 7771 states and 29294 transitions. [2025-04-13 23:22:33,250 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 23:22:33,250 INFO L278 IsEmpty]: Start isEmpty. Operand 7771 states and 29294 transitions. [2025-04-13 23:22:33,270 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:22:33,270 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:22:33,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 23:22:33,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:22:33,270 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 23:22:33,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:22:33,271 INFO L85 PathProgramCache]: Analyzing trace with hash 42950937, now seen corresponding path program 4 times [2025-04-13 23:22:33,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:22:33,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88205378] [2025-04-13 23:22:33,271 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:22:33,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:22:33,279 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:22:33,399 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 23:22:33,399 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:22:33,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:22:35,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:22:35,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88205378] [2025-04-13 23:22:35,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88205378] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:22:35,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:22:35,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:22:35,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223523956] [2025-04-13 23:22:35,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:22:35,047 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:22:35,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:22:35,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:22:35,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:22:35,047 INFO L87 Difference]: Start difference. First operand 7771 states and 29294 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:36,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:22:36,491 INFO L93 Difference]: Finished difference Result 14489 states and 52985 transitions. [2025-04-13 23:22:36,492 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:22:36,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 23:22:36,492 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:22:36,567 INFO L225 Difference]: With dead ends: 14489 [2025-04-13 23:22:36,567 INFO L226 Difference]: Without dead ends: 14349 [2025-04-13 23:22:36,575 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:22:36,576 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 315 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:22:36,576 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 120 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 23:22:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14349 states. [2025-04-13 23:22:36,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14349 to 8506. [2025-04-13 23:22:36,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8506 states, 8505 states have (on average 3.754967666078777) internal successors, (31936), 8505 states have internal predecessors, (31936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:36,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8506 states to 8506 states and 31936 transitions. [2025-04-13 23:22:36,939 INFO L79 Accepts]: Start accepts. Automaton has 8506 states and 31936 transitions. Word has length 54 [2025-04-13 23:22:36,939 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:22:36,939 INFO L485 AbstractCegarLoop]: Abstraction has 8506 states and 31936 transitions. [2025-04-13 23:22:36,940 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:36,940 INFO L278 IsEmpty]: Start isEmpty. Operand 8506 states and 31936 transitions. [2025-04-13 23:22:36,958 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:22:36,958 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:22:36,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:22:36,958 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:22:36,958 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 23:22:36,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:22:36,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1579573437, now seen corresponding path program 5 times [2025-04-13 23:22:36,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:22:36,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119651855] [2025-04-13 23:22:36,959 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:22:36,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:22:36,966 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:22:36,997 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:22:36,997 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:22:36,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:22:38,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:22:38,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119651855] [2025-04-13 23:22:38,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119651855] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:22:38,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:22:38,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:22:38,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131704289] [2025-04-13 23:22:38,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:22:38,360 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:22:38,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:22:38,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:22:38,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:22:38,361 INFO L87 Difference]: Start difference. First operand 8506 states and 31936 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:39,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:22:39,907 INFO L93 Difference]: Finished difference Result 16695 states and 60389 transitions. [2025-04-13 23:22:39,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:22:39,908 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:22:39,908 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:22:39,990 INFO L225 Difference]: With dead ends: 16695 [2025-04-13 23:22:39,990 INFO L226 Difference]: Without dead ends: 16555 [2025-04-13 23:22:39,998 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:22:39,999 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 288 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 1787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:22:40,000 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 159 Invalid, 1787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 23:22:40,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16555 states. [2025-04-13 23:22:40,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16555 to 8776. [2025-04-13 23:22:40,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8776 states, 8775 states have (on average 3.7505413105413106) internal successors, (32911), 8775 states have internal predecessors, (32911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8776 states to 8776 states and 32911 transitions. [2025-04-13 23:22:40,385 INFO L79 Accepts]: Start accepts. Automaton has 8776 states and 32911 transitions. Word has length 54 [2025-04-13 23:22:40,386 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:22:40,386 INFO L485 AbstractCegarLoop]: Abstraction has 8776 states and 32911 transitions. [2025-04-13 23:22:40,386 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:40,386 INFO L278 IsEmpty]: Start isEmpty. Operand 8776 states and 32911 transitions. [2025-04-13 23:22:40,407 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:22:40,407 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:22:40,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:22:40,409 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:22:40,409 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 23:22:40,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:22:40,409 INFO L85 PathProgramCache]: Analyzing trace with hash -159678089, now seen corresponding path program 6 times [2025-04-13 23:22:40,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:22:40,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500109343] [2025-04-13 23:22:40,409 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:22:40,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:22:40,418 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:22:40,448 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:22:40,448 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:22:40,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:41,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:22:41,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:22:41,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500109343] [2025-04-13 23:22:41,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500109343] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:22:41,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:22:41,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:22:41,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099593500] [2025-04-13 23:22:41,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:22:41,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:22:41,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:22:41,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:22:41,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:22:41,522 INFO L87 Difference]: Start difference. First operand 8776 states and 32911 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:42,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:22:42,704 INFO L93 Difference]: Finished difference Result 14958 states and 54511 transitions. [2025-04-13 23:22:42,704 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:22:42,705 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:22:42,705 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:22:42,763 INFO L225 Difference]: With dead ends: 14958 [2025-04-13 23:22:42,763 INFO L226 Difference]: Without dead ends: 14887 [2025-04-13 23:22:42,770 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:22:42,771 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 309 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 1685 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:22:42,771 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 145 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1685 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:22:42,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14887 states. [2025-04-13 23:22:43,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14887 to 8974. [2025-04-13 23:22:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8974 states, 8973 states have (on average 3.7342026078234705) internal successors, (33507), 8973 states have internal predecessors, (33507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:43,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8974 states to 8974 states and 33507 transitions. [2025-04-13 23:22:43,084 INFO L79 Accepts]: Start accepts. Automaton has 8974 states and 33507 transitions. Word has length 54 [2025-04-13 23:22:43,084 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:22:43,084 INFO L485 AbstractCegarLoop]: Abstraction has 8974 states and 33507 transitions. [2025-04-13 23:22:43,084 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:43,084 INFO L278 IsEmpty]: Start isEmpty. Operand 8974 states and 33507 transitions. [2025-04-13 23:22:43,105 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:22:43,105 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:22:43,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 23:22:43,106 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:22:43,106 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 23:22:43,107 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:22:43,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1376944411, now seen corresponding path program 7 times [2025-04-13 23:22:43,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:22:43,107 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255936190] [2025-04-13 23:22:43,107 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:22:43,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:22:43,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:22:43,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:22:43,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:22:43,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:44,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:22:44,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:22:44,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255936190] [2025-04-13 23:22:44,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255936190] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:22:44,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:22:44,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:22:44,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947575271] [2025-04-13 23:22:44,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:22:44,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:22:44,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:22:44,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:22:44,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:22:44,130 INFO L87 Difference]: Start difference. First operand 8974 states and 33507 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:45,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:22:45,499 INFO L93 Difference]: Finished difference Result 16718 states and 60398 transitions. [2025-04-13 23:22:45,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:22:45,499 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:22:45,499 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:22:45,561 INFO L225 Difference]: With dead ends: 16718 [2025-04-13 23:22:45,562 INFO L226 Difference]: Without dead ends: 16647 [2025-04-13 23:22:45,569 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:22:45,570 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 307 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 1807 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:22:45,570 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 163 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1807 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 23:22:45,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16647 states. [2025-04-13 23:22:45,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16647 to 8787. [2025-04-13 23:22:45,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8787 states, 8786 states have (on average 3.7489187343501023) internal successors, (32938), 8786 states have internal predecessors, (32938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8787 states to 8787 states and 32938 transitions. [2025-04-13 23:22:45,847 INFO L79 Accepts]: Start accepts. Automaton has 8787 states and 32938 transitions. Word has length 54 [2025-04-13 23:22:45,847 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:22:45,847 INFO L485 AbstractCegarLoop]: Abstraction has 8787 states and 32938 transitions. [2025-04-13 23:22:45,847 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:45,847 INFO L278 IsEmpty]: Start isEmpty. Operand 8787 states and 32938 transitions. [2025-04-13 23:22:45,864 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:22:45,864 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:22:45,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:22:45,865 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:22:45,865 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 23:22:45,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:22:45,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1694508061, now seen corresponding path program 8 times [2025-04-13 23:22:45,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:22:45,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17868003] [2025-04-13 23:22:45,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:22:45,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:22:45,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:22:45,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:22:45,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:22:45,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:22:46,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:22:46,767 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17868003] [2025-04-13 23:22:46,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17868003] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:22:46,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:22:46,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:22:46,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329094008] [2025-04-13 23:22:46,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:22:46,767 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:22:46,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:22:46,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:22:46,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:22:46,768 INFO L87 Difference]: Start difference. First operand 8787 states and 32938 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:22:47,818 INFO L93 Difference]: Finished difference Result 14898 states and 54347 transitions. [2025-04-13 23:22:47,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:22:47,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 23:22:47,819 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:22:47,877 INFO L225 Difference]: With dead ends: 14898 [2025-04-13 23:22:47,877 INFO L226 Difference]: Without dead ends: 14784 [2025-04-13 23:22:47,884 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:22:47,884 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 312 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:22:47,884 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 139 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:22:47,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14784 states. [2025-04-13 23:22:48,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14784 to 8941. [2025-04-13 23:22:48,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8941 states, 8940 states have (on average 3.735234899328859) internal successors, (33393), 8940 states have internal predecessors, (33393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8941 states to 8941 states and 33393 transitions. [2025-04-13 23:22:48,159 INFO L79 Accepts]: Start accepts. Automaton has 8941 states and 33393 transitions. Word has length 54 [2025-04-13 23:22:48,159 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:22:48,159 INFO L485 AbstractCegarLoop]: Abstraction has 8941 states and 33393 transitions. [2025-04-13 23:22:48,159 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:48,159 INFO L278 IsEmpty]: Start isEmpty. Operand 8941 states and 33393 transitions. [2025-04-13 23:22:48,177 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:22:48,177 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:22:48,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:22:48,177 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 23:22:48,178 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 23:22:48,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:22:48,178 INFO L85 PathProgramCache]: Analyzing trace with hash -157885561, now seen corresponding path program 9 times [2025-04-13 23:22:48,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:22:48,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676861071] [2025-04-13 23:22:48,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:22:48,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:22:48,183 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:22:48,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:22:48,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:22:48,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:49,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:22:49,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:22:49,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676861071] [2025-04-13 23:22:49,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676861071] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:22:49,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:22:49,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:22:49,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91023063] [2025-04-13 23:22:49,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:22:49,163 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:22:49,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:22:49,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:22:49,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:22:49,164 INFO L87 Difference]: Start difference. First operand 8941 states and 33393 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:22:50,250 INFO L93 Difference]: Finished difference Result 16603 states and 60066 transitions. [2025-04-13 23:22:50,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:22:50,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 23:22:50,250 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:22:50,308 INFO L225 Difference]: With dead ends: 16603 [2025-04-13 23:22:50,308 INFO L226 Difference]: Without dead ends: 16489 [2025-04-13 23:22:50,315 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 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 23:22:50,316 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 289 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:22:50,316 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 155 Invalid, 1731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1704 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:22:50,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16489 states. [2025-04-13 23:22:50,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16489 to 8743. [2025-04-13 23:22:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8743 states, 8742 states have (on average 3.7516586593456873) internal successors, (32797), 8742 states have internal predecessors, (32797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8743 states to 8743 states and 32797 transitions. [2025-04-13 23:22:50,574 INFO L79 Accepts]: Start accepts. Automaton has 8743 states and 32797 transitions. Word has length 54 [2025-04-13 23:22:50,574 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:22:50,575 INFO L485 AbstractCegarLoop]: Abstraction has 8743 states and 32797 transitions. [2025-04-13 23:22:50,575 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:50,575 INFO L278 IsEmpty]: Start isEmpty. Operand 8743 states and 32797 transitions. [2025-04-13 23:22:50,590 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:22:50,591 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:22:50,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 23:22:50,591 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 23:22:50,591 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 23:22:50,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:22:50,591 INFO L85 PathProgramCache]: Analyzing trace with hash -105340583, now seen corresponding path program 10 times [2025-04-13 23:22:50,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:22:50,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961217901] [2025-04-13 23:22:50,591 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:22:50,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:22:50,596 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:22:50,622 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 23:22:50,622 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:22:50,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:22:51,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:22:51,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961217901] [2025-04-13 23:22:51,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961217901] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:22:51,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:22:51,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:22:51,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990875562] [2025-04-13 23:22:51,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:22:51,330 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:22:51,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:22:51,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:22:51,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:22:51,331 INFO L87 Difference]: Start difference. First operand 8743 states and 32797 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:52,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:22:52,501 INFO L93 Difference]: Finished difference Result 14924 states and 54398 transitions. [2025-04-13 23:22:52,501 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:22:52,501 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:22:52,501 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:22:52,553 INFO L225 Difference]: With dead ends: 14924 [2025-04-13 23:22:52,554 INFO L226 Difference]: Without dead ends: 14853 [2025-04-13 23:22:52,559 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=470, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:22:52,560 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 294 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 1825 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:22:52,560 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 155 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1825 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:22:52,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14853 states. [2025-04-13 23:22:52,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14853 to 8930. [2025-04-13 23:22:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8930 states, 8929 states have (on average 3.735580692126778) internal successors, (33355), 8929 states have internal predecessors, (33355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8930 states to 8930 states and 33355 transitions. [2025-04-13 23:22:52,795 INFO L79 Accepts]: Start accepts. Automaton has 8930 states and 33355 transitions. Word has length 54 [2025-04-13 23:22:52,795 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:22:52,795 INFO L485 AbstractCegarLoop]: Abstraction has 8930 states and 33355 transitions. [2025-04-13 23:22:52,796 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:52,796 INFO L278 IsEmpty]: Start isEmpty. Operand 8930 states and 33355 transitions. [2025-04-13 23:22:52,813 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:22:52,813 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:22:52,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:22:52,813 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 23:22:52,814 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 23:22:52,814 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:22:52,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1431281917, now seen corresponding path program 11 times [2025-04-13 23:22:52,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:22:52,814 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37402934] [2025-04-13 23:22:52,814 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:22:52,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:22:52,818 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:22:52,834 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:22:52,834 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:22:52,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:53,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 23:22:53,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:22:53,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37402934] [2025-04-13 23:22:53,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37402934] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:22:53,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:22:53,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:22:53,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993090716] [2025-04-13 23:22:53,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:22:53,597 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:22:53,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:22:53,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:22:53,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:22:53,598 INFO L87 Difference]: Start difference. First operand 8930 states and 33355 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:54,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:22:54,640 INFO L93 Difference]: Finished difference Result 16706 states and 60361 transitions. [2025-04-13 23:22:54,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:22:54,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 23:22:54,641 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:22:54,703 INFO L225 Difference]: With dead ends: 16706 [2025-04-13 23:22:54,703 INFO L226 Difference]: Without dead ends: 16635 [2025-04-13 23:22:54,711 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=433, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:22:54,712 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 294 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 1762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:22:54,712 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 149 Invalid, 1762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1733 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:22:54,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16635 states. [2025-04-13 23:22:54,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16635 to 8776. [2025-04-13 23:22:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8776 states, 8775 states have (on average 3.7492877492877494) internal successors, (32900), 8775 states have internal predecessors, (32900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8776 states to 8776 states and 32900 transitions. [2025-04-13 23:22:54,953 INFO L79 Accepts]: Start accepts. Automaton has 8776 states and 32900 transitions. Word has length 54 [2025-04-13 23:22:54,953 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:22:54,953 INFO L485 AbstractCegarLoop]: Abstraction has 8776 states and 32900 transitions. [2025-04-13 23:22:54,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 23:22:54,953 INFO L278 IsEmpty]: Start isEmpty. Operand 8776 states and 32900 transitions. [2025-04-13 23:22:54,970 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:22:54,970 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:22:54,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 23:22:54,970 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 23:22:54,970 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 23:22:54,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:22:54,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1640170555, now seen corresponding path program 12 times [2025-04-13 23:22:54,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:22:54,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126207705] [2025-04-13 23:22:54,971 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:22:54,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:22:54,975 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:22:54,988 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:22:54,988 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:22:54,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:55,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:22:55,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:22:55,690 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126207705] [2025-04-13 23:22:55,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126207705] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:22:55,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:22:55,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:22:55,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345737552] [2025-04-13 23:22:55,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:22:55,691 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:22:55,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:22:55,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:22:55,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:22:55,691 INFO L87 Difference]: Start difference. First operand 8776 states and 32900 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:56,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:22:56,757 INFO L93 Difference]: Finished difference Result 14956 states and 54488 transitions. [2025-04-13 23:22:56,757 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:22:56,757 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:22:56,757 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:22:56,812 INFO L225 Difference]: With dead ends: 14956 [2025-04-13 23:22:56,813 INFO L226 Difference]: Without dead ends: 14875 [2025-04-13 23:22:56,818 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:22:56,819 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 301 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 1813 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:22:56,819 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 155 Invalid, 1832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1813 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:22:56,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14875 states. [2025-04-13 23:22:56,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14875 to 8952. [2025-04-13 23:22:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8952 states, 8951 states have (on average 3.7336610434588313) internal successors, (33420), 8951 states have internal predecessors, (33420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:57,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8952 states to 8952 states and 33420 transitions. [2025-04-13 23:22:57,051 INFO L79 Accepts]: Start accepts. Automaton has 8952 states and 33420 transitions. Word has length 54 [2025-04-13 23:22:57,051 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:22:57,051 INFO L485 AbstractCegarLoop]: Abstraction has 8952 states and 33420 transitions. [2025-04-13 23:22:57,051 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:57,052 INFO L278 IsEmpty]: Start isEmpty. Operand 8952 states and 33420 transitions. [2025-04-13 23:22:57,068 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:22:57,068 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:22:57,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:22:57,069 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 23:22:57,069 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 23:22:57,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:22:57,069 INFO L85 PathProgramCache]: Analyzing trace with hash -103548055, now seen corresponding path program 13 times [2025-04-13 23:22:57,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:22:57,069 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518204959] [2025-04-13 23:22:57,069 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:22:57,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:22:57,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:22:57,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:22:57,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:22:57,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:57,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:22:57,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:22:57,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518204959] [2025-04-13 23:22:57,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518204959] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:22:57,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:22:57,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:22:57,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238538979] [2025-04-13 23:22:57,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:22:57,772 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:22:57,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:22:57,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:22:57,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:22:57,773 INFO L87 Difference]: Start difference. First operand 8952 states and 33420 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:58,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:22:58,849 INFO L93 Difference]: Finished difference Result 16694 states and 60310 transitions. [2025-04-13 23:22:58,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:22:58,849 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:22:58,849 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:22:58,904 INFO L225 Difference]: With dead ends: 16694 [2025-04-13 23:22:58,904 INFO L226 Difference]: Without dead ends: 16613 [2025-04-13 23:22:58,910 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=400, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:22:58,911 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 302 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1685 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:22:58,911 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 147 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1685 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:22:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16613 states. [2025-04-13 23:22:59,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16613 to 8765. [2025-04-13 23:22:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8765 states, 8764 states have (on average 3.7496576905522594) internal successors, (32862), 8764 states have internal predecessors, (32862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8765 states to 8765 states and 32862 transitions. [2025-04-13 23:22:59,150 INFO L79 Accepts]: Start accepts. Automaton has 8765 states and 32862 transitions. Word has length 54 [2025-04-13 23:22:59,150 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:22:59,151 INFO L485 AbstractCegarLoop]: Abstraction has 8765 states and 32862 transitions. [2025-04-13 23:22:59,151 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:59,151 INFO L278 IsEmpty]: Start isEmpty. Operand 8765 states and 32862 transitions. [2025-04-13 23:22:59,167 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:22:59,167 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:22:59,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 23:22:59,167 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 23:22:59,167 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 23:22:59,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:22:59,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1762622035, now seen corresponding path program 14 times [2025-04-13 23:22:59,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:22:59,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823995003] [2025-04-13 23:22:59,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:22:59,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:22:59,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:22:59,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:22:59,185 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:22:59,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:59,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:22:59,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:22:59,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823995003] [2025-04-13 23:22:59,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823995003] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:22:59,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:22:59,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:22:59,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559394519] [2025-04-13 23:22:59,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:22:59,917 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:22:59,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:22:59,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:22:59,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:22:59,917 INFO L87 Difference]: Start difference. First operand 8765 states and 32862 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:00,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:00,914 INFO L93 Difference]: Finished difference Result 14864 states and 54234 transitions. [2025-04-13 23:23:00,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:23:00,914 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:23:00,914 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:00,965 INFO L225 Difference]: With dead ends: 14864 [2025-04-13 23:23:00,966 INFO L226 Difference]: Without dead ends: 14574 [2025-04-13 23:23:00,972 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=441, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:23:00,972 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 295 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:00,973 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 142 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:23:00,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14574 states. [2025-04-13 23:23:01,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14574 to 8765. [2025-04-13 23:23:01,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8765 states, 8764 states have (on average 3.745892286627111) internal successors, (32829), 8764 states have internal predecessors, (32829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8765 states to 8765 states and 32829 transitions. [2025-04-13 23:23:01,203 INFO L79 Accepts]: Start accepts. Automaton has 8765 states and 32829 transitions. Word has length 54 [2025-04-13 23:23:01,204 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:01,204 INFO L485 AbstractCegarLoop]: Abstraction has 8765 states and 32829 transitions. [2025-04-13 23:23:01,204 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:01,204 INFO L278 IsEmpty]: Start isEmpty. Operand 8765 states and 32829 transitions. [2025-04-13 23:23:01,220 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:01,220 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:01,220 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:01,220 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 23:23:01,220 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 23:23:01,221 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:01,221 INFO L85 PathProgramCache]: Analyzing trace with hash -995722761, now seen corresponding path program 15 times [2025-04-13 23:23:01,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:01,221 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208436324] [2025-04-13 23:23:01,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:23:01,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:01,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:01,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:01,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:23:01,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:01,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:01,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208436324] [2025-04-13 23:23:01,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208436324] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:01,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:01,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:01,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190744349] [2025-04-13 23:23:01,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:01,989 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:01,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:01,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:01,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:01,990 INFO L87 Difference]: Start difference. First operand 8765 states and 32829 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:03,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:03,043 INFO L93 Difference]: Finished difference Result 16437 states and 59541 transitions. [2025-04-13 23:23:03,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:23:03,043 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:23:03,043 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:03,103 INFO L225 Difference]: With dead ends: 16437 [2025-04-13 23:23:03,103 INFO L226 Difference]: Without dead ends: 16147 [2025-04-13 23:23:03,110 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:23:03,111 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 270 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:03,111 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 158 Invalid, 1800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:23:03,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16147 states. [2025-04-13 23:23:03,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16147 to 8589. [2025-04-13 23:23:03,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8589 states, 8588 states have (on average 3.7586166744294363) internal successors, (32279), 8588 states have internal predecessors, (32279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:03,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8589 states to 8589 states and 32279 transitions. [2025-04-13 23:23:03,371 INFO L79 Accepts]: Start accepts. Automaton has 8589 states and 32279 transitions. Word has length 54 [2025-04-13 23:23:03,372 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:03,372 INFO L485 AbstractCegarLoop]: Abstraction has 8589 states and 32279 transitions. [2025-04-13 23:23:03,372 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:03,372 INFO L278 IsEmpty]: Start isEmpty. Operand 8589 states and 32279 transitions. [2025-04-13 23:23:03,389 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:03,389 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:03,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:03,389 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 23:23:03,389 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 23:23:03,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:03,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1955421863, now seen corresponding path program 16 times [2025-04-13 23:23:03,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:03,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917113170] [2025-04-13 23:23:03,390 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:03,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:03,394 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:23:03,397 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 23:23:03,397 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:03,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:03,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:03,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917113170] [2025-04-13 23:23:03,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917113170] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:03,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:03,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:23:03,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363859967] [2025-04-13 23:23:03,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:03,448 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:23:03,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:03,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:23:03,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:23:03,448 INFO L87 Difference]: Start difference. First operand 8589 states and 32279 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 23:23:03,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:03,570 INFO L93 Difference]: Finished difference Result 10676 states and 39894 transitions. [2025-04-13 23:23:03,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:23:03,570 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 23:23:03,570 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:03,606 INFO L225 Difference]: With dead ends: 10676 [2025-04-13 23:23:03,607 INFO L226 Difference]: Without dead ends: 6529 [2025-04-13 23:23:03,615 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 23:23:03,617 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:03,617 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 7 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:03,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6529 states. [2025-04-13 23:23:03,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6529 to 6529. [2025-04-13 23:23:03,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6529 states, 6528 states have (on average 3.678768382352941) internal successors, (24015), 6528 states have internal predecessors, (24015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:03,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6529 states to 6529 states and 24015 transitions. [2025-04-13 23:23:03,822 INFO L79 Accepts]: Start accepts. Automaton has 6529 states and 24015 transitions. Word has length 54 [2025-04-13 23:23:03,822 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:03,822 INFO L485 AbstractCegarLoop]: Abstraction has 6529 states and 24015 transitions. [2025-04-13 23:23:03,822 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 23:23:03,822 INFO L278 IsEmpty]: Start isEmpty. Operand 6529 states and 24015 transitions. [2025-04-13 23:23:03,833 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:03,833 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:03,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 23:23:03,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 23:23:03,834 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 23:23:03,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:03,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1468605825, now seen corresponding path program 17 times [2025-04-13 23:23:03,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:03,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785294413] [2025-04-13 23:23:03,835 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:03,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:03,838 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:03,852 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:03,852 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:23:03,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:04,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 23:23:04,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:04,561 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785294413] [2025-04-13 23:23:04,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785294413] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:04,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:04,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:04,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080056364] [2025-04-13 23:23:04,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:04,562 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:04,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:04,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:04,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:04,562 INFO L87 Difference]: Start difference. First operand 6529 states and 24015 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:05,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:05,515 INFO L93 Difference]: Finished difference Result 12674 states and 45108 transitions. [2025-04-13 23:23:05,515 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:05,516 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:23:05,516 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:05,575 INFO L225 Difference]: With dead ends: 12674 [2025-04-13 23:23:05,575 INFO L226 Difference]: Without dead ends: 12603 [2025-04-13 23:23:05,581 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 23:23:05,582 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 275 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:05,582 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 133 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:23:05,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12603 states. [2025-04-13 23:23:05,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12603 to 6604. [2025-04-13 23:23:05,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6604 states, 6603 states have (on average 3.677116462214145) internal successors, (24280), 6603 states have internal predecessors, (24280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:05,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6604 states to 6604 states and 24280 transitions. [2025-04-13 23:23:05,801 INFO L79 Accepts]: Start accepts. Automaton has 6604 states and 24280 transitions. Word has length 54 [2025-04-13 23:23:05,801 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:05,801 INFO L485 AbstractCegarLoop]: Abstraction has 6604 states and 24280 transitions. [2025-04-13 23:23:05,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 23:23:05,802 INFO L278 IsEmpty]: Start isEmpty. Operand 6604 states and 24280 transitions. [2025-04-13 23:23:05,814 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:05,814 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:05,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:05,814 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 23:23:05,814 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 23:23:05,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:05,815 INFO L85 PathProgramCache]: Analyzing trace with hash -365831497, now seen corresponding path program 18 times [2025-04-13 23:23:05,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:05,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398031139] [2025-04-13 23:23:05,815 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:05,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:05,819 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:05,831 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:05,831 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:23:05,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:06,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:06,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:06,492 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398031139] [2025-04-13 23:23:06,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398031139] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:06,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:06,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:06,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204398207] [2025-04-13 23:23:06,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:06,492 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:06,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:06,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:06,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:06,493 INFO L87 Difference]: Start difference. First operand 6604 states and 24280 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:07,631 INFO L93 Difference]: Finished difference Result 11131 states and 39623 transitions. [2025-04-13 23:23:07,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:07,632 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:23:07,632 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:07,679 INFO L225 Difference]: With dead ends: 11131 [2025-04-13 23:23:07,679 INFO L226 Difference]: Without dead ends: 11014 [2025-04-13 23:23:07,684 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:23:07,685 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 269 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:07,685 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 158 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1787 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:23:07,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11014 states. [2025-04-13 23:23:07,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11014 to 6785. [2025-04-13 23:23:07,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6785 states, 6784 states have (on average 3.6575766509433962) internal successors, (24813), 6784 states have internal predecessors, (24813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:07,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6785 states to 6785 states and 24813 transitions. [2025-04-13 23:23:07,903 INFO L79 Accepts]: Start accepts. Automaton has 6785 states and 24813 transitions. Word has length 54 [2025-04-13 23:23:07,903 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:07,903 INFO L485 AbstractCegarLoop]: Abstraction has 6785 states and 24813 transitions. [2025-04-13 23:23:07,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 23:23:07,903 INFO L278 IsEmpty]: Start isEmpty. Operand 6785 states and 24813 transitions. [2025-04-13 23:23:07,915 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:07,915 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:07,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:07,915 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 23:23:07,915 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 23:23:07,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:07,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2026356895, now seen corresponding path program 19 times [2025-04-13 23:23:07,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:07,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375454907] [2025-04-13 23:23:07,916 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:23:07,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:07,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:07,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:07,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:07,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:08,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 23:23:08,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:08,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375454907] [2025-04-13 23:23:08,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375454907] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:08,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:08,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:08,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101756470] [2025-04-13 23:23:08,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:08,590 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:08,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:08,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:08,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:08,591 INFO L87 Difference]: Start difference. First operand 6785 states and 24813 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:09,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:09,462 INFO L93 Difference]: Finished difference Result 12784 states and 45451 transitions. [2025-04-13 23:23:09,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:09,462 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:23:09,462 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:09,509 INFO L225 Difference]: With dead ends: 12784 [2025-04-13 23:23:09,509 INFO L226 Difference]: Without dead ends: 12706 [2025-04-13 23:23:09,514 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 23:23:09,515 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 326 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:09,515 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 106 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:23:09,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12706 states. [2025-04-13 23:23:09,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12706 to 6775. [2025-04-13 23:23:09,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6775 states, 6774 states have (on average 3.657809270741069) internal successors, (24778), 6774 states have internal predecessors, (24778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:09,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6775 states to 6775 states and 24778 transitions. [2025-04-13 23:23:09,719 INFO L79 Accepts]: Start accepts. Automaton has 6775 states and 24778 transitions. Word has length 54 [2025-04-13 23:23:09,719 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:09,719 INFO L485 AbstractCegarLoop]: Abstraction has 6775 states and 24778 transitions. [2025-04-13 23:23:09,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 23:23:09,720 INFO L278 IsEmpty]: Start isEmpty. Operand 6775 states and 24778 transitions. [2025-04-13 23:23:09,731 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:09,731 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:09,731 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:09,731 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 23:23:09,731 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 23:23:09,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:09,732 INFO L85 PathProgramCache]: Analyzing trace with hash -568460523, now seen corresponding path program 20 times [2025-04-13 23:23:09,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:09,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688556663] [2025-04-13 23:23:09,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:09,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:09,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:09,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:09,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:23:09,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:10,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:10,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:10,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688556663] [2025-04-13 23:23:10,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688556663] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:10,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:10,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:10,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281410824] [2025-04-13 23:23:10,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:10,372 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:10,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:10,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:10,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:10,373 INFO L87 Difference]: Start difference. First operand 6775 states and 24778 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:11,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:11,203 INFO L93 Difference]: Finished difference Result 11156 states and 39648 transitions. [2025-04-13 23:23:11,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:11,203 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:23:11,203 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:11,249 INFO L225 Difference]: With dead ends: 11156 [2025-04-13 23:23:11,249 INFO L226 Difference]: Without dead ends: 11085 [2025-04-13 23:23:11,254 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:23:11,254 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 310 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:11,254 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 120 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:23:11,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11085 states. [2025-04-13 23:23:11,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11085 to 6786. [2025-04-13 23:23:11,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6786 states, 6785 states have (on average 3.655858511422255) internal successors, (24805), 6785 states have internal predecessors, (24805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6786 states to 6786 states and 24805 transitions. [2025-04-13 23:23:11,489 INFO L79 Accepts]: Start accepts. Automaton has 6786 states and 24805 transitions. Word has length 54 [2025-04-13 23:23:11,489 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:11,489 INFO L485 AbstractCegarLoop]: Abstraction has 6786 states and 24805 transitions. [2025-04-13 23:23:11,489 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:11,489 INFO L278 IsEmpty]: Start isEmpty. Operand 6786 states and 24805 transitions. [2025-04-13 23:23:11,503 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:11,503 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:11,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:11,503 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 23:23:11,503 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 23:23:11,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:11,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1111997053, now seen corresponding path program 21 times [2025-04-13 23:23:11,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:11,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289112997] [2025-04-13 23:23:11,504 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:23:11,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:11,509 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:11,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:11,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:23:11,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:12,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:12,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289112997] [2025-04-13 23:23:12,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289112997] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:12,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:12,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:12,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064382537] [2025-04-13 23:23:12,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:12,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:12,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:12,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:12,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:12,316 INFO L87 Difference]: Start difference. First operand 6786 states and 24805 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:13,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:13,280 INFO L93 Difference]: Finished difference Result 12834 states and 45584 transitions. [2025-04-13 23:23:13,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:13,280 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:23:13,280 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:13,340 INFO L225 Difference]: With dead ends: 12834 [2025-04-13 23:23:13,340 INFO L226 Difference]: Without dead ends: 12697 [2025-04-13 23:23:13,346 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 23:23:13,346 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 289 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:13,347 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 120 Invalid, 1618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:23:13,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12697 states. [2025-04-13 23:23:13,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12697 to 6766. [2025-04-13 23:23:13,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6766 states, 6765 states have (on average 3.656319290465632) internal successors, (24735), 6765 states have internal predecessors, (24735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:13,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6766 states to 6766 states and 24735 transitions. [2025-04-13 23:23:13,534 INFO L79 Accepts]: Start accepts. Automaton has 6766 states and 24735 transitions. Word has length 54 [2025-04-13 23:23:13,534 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:13,534 INFO L485 AbstractCegarLoop]: Abstraction has 6766 states and 24735 transitions. [2025-04-13 23:23:13,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 23:23:13,534 INFO L278 IsEmpty]: Start isEmpty. Operand 6766 states and 24735 transitions. [2025-04-13 23:23:13,545 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:13,545 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:13,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:13,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 23:23:13,546 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:23:13,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:13,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2103290495, now seen corresponding path program 22 times [2025-04-13 23:23:13,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:13,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684453203] [2025-04-13 23:23:13,546 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:13,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:13,550 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:23:13,564 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 23:23:13,564 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:13,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:14,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 23:23:14,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:14,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684453203] [2025-04-13 23:23:14,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684453203] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:14,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:14,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:14,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672078767] [2025-04-13 23:23:14,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:14,133 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:14,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:14,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:14,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:14,134 INFO L87 Difference]: Start difference. First operand 6766 states and 24735 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:14,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:14,993 INFO L93 Difference]: Finished difference Result 11065 states and 39387 transitions. [2025-04-13 23:23:14,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:14,994 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:23:14,994 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:15,038 INFO L225 Difference]: With dead ends: 11065 [2025-04-13 23:23:15,038 INFO L226 Difference]: Without dead ends: 10962 [2025-04-13 23:23:15,042 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:23:15,043 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 275 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:15,044 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 132 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:23:15,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10962 states. [2025-04-13 23:23:15,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10962 to 6733. [2025-04-13 23:23:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6733 states, 6732 states have (on average 3.6589423648247177) internal successors, (24632), 6732 states have internal predecessors, (24632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:15,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6733 states to 6733 states and 24632 transitions. [2025-04-13 23:23:15,205 INFO L79 Accepts]: Start accepts. Automaton has 6733 states and 24632 transitions. Word has length 54 [2025-04-13 23:23:15,206 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:15,206 INFO L485 AbstractCegarLoop]: Abstraction has 6733 states and 24632 transitions. [2025-04-13 23:23:15,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 23:23:15,206 INFO L278 IsEmpty]: Start isEmpty. Operand 6733 states and 24632 transitions. [2025-04-13 23:23:15,218 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:15,218 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:15,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:15,218 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 23:23:15,218 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 23:23:15,218 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:15,218 INFO L85 PathProgramCache]: Analyzing trace with hash -809765503, now seen corresponding path program 23 times [2025-04-13 23:23:15,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:15,218 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405494286] [2025-04-13 23:23:15,218 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:15,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:15,223 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:15,241 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:15,241 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:23:15,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:15,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:15,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405494286] [2025-04-13 23:23:15,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405494286] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:15,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:15,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:15,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047743028] [2025-04-13 23:23:15,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:15,871 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:15,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:15,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:15,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:15,871 INFO L87 Difference]: Start difference. First operand 6733 states and 24632 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:16,809 INFO L93 Difference]: Finished difference Result 12932 states and 45823 transitions. [2025-04-13 23:23:16,809 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:16,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 23:23:16,809 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:16,853 INFO L225 Difference]: With dead ends: 12932 [2025-04-13 23:23:16,853 INFO L226 Difference]: Without dead ends: 12861 [2025-04-13 23:23:16,858 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 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 23:23:16,859 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 314 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1555 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:16,859 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 116 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1555 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:23:16,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2025-04-13 23:23:16,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 6748. [2025-04-13 23:23:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6748 states, 6747 states have (on average 3.6574773973617902) internal successors, (24677), 6747 states have internal predecessors, (24677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:17,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6748 states to 6748 states and 24677 transitions. [2025-04-13 23:23:17,029 INFO L79 Accepts]: Start accepts. Automaton has 6748 states and 24677 transitions. Word has length 54 [2025-04-13 23:23:17,029 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:17,030 INFO L485 AbstractCegarLoop]: Abstraction has 6748 states and 24677 transitions. [2025-04-13 23:23:17,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 23:23:17,030 INFO L278 IsEmpty]: Start isEmpty. Operand 6748 states and 24677 transitions. [2025-04-13 23:23:17,041 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:17,041 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:17,041 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:17,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 23:23:17,041 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 23:23:17,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:17,042 INFO L85 PathProgramCache]: Analyzing trace with hash -514123017, now seen corresponding path program 24 times [2025-04-13 23:23:17,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:17,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052200364] [2025-04-13 23:23:17,042 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:17,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:17,045 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:17,055 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:17,055 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:23:17,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:17,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 23:23:17,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:17,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052200364] [2025-04-13 23:23:17,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052200364] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:17,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:17,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:17,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205893227] [2025-04-13 23:23:17,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:17,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:17,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:17,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:17,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:17,632 INFO L87 Difference]: Start difference. First operand 6748 states and 24677 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:18,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:18,572 INFO L93 Difference]: Finished difference Result 11096 states and 39444 transitions. [2025-04-13 23:23:18,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:18,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 23:23:18,573 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:18,612 INFO L225 Difference]: With dead ends: 11096 [2025-04-13 23:23:18,612 INFO L226 Difference]: Without dead ends: 11025 [2025-04-13 23:23:18,614 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:23:18,614 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 291 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:18,614 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 134 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1545 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:23:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11025 states. [2025-04-13 23:23:18,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11025 to 6781. [2025-04-13 23:23:18,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6781 states, 6780 states have (on average 3.6548672566371683) internal successors, (24780), 6780 states have internal predecessors, (24780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6781 states to 6781 states and 24780 transitions. [2025-04-13 23:23:18,759 INFO L79 Accepts]: Start accepts. Automaton has 6781 states and 24780 transitions. Word has length 54 [2025-04-13 23:23:18,759 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:18,759 INFO L485 AbstractCegarLoop]: Abstraction has 6781 states and 24780 transitions. [2025-04-13 23:23:18,759 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:18,759 INFO L278 IsEmpty]: Start isEmpty. Operand 6781 states and 24780 transitions. [2025-04-13 23:23:18,771 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:18,771 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:18,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:18,771 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 23:23:18,771 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 23:23:18,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:18,771 INFO L85 PathProgramCache]: Analyzing trace with hash -9760927, now seen corresponding path program 25 times [2025-04-13 23:23:18,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:18,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247248022] [2025-04-13 23:23:18,771 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:23:18,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:18,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:18,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:18,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:18,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:19,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 23:23:19,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:19,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247248022] [2025-04-13 23:23:19,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247248022] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:19,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:19,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:19,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239949399] [2025-04-13 23:23:19,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:19,405 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:19,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:19,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:19,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:19,405 INFO L87 Difference]: Start difference. First operand 6781 states and 24780 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:20,440 INFO L93 Difference]: Finished difference Result 12962 states and 45909 transitions. [2025-04-13 23:23:20,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:23:20,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 23:23:20,441 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:20,490 INFO L225 Difference]: With dead ends: 12962 [2025-04-13 23:23:20,490 INFO L226 Difference]: Without dead ends: 12884 [2025-04-13 23:23:20,496 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:23:20,496 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 296 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:20,496 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 123 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1655 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:23:20,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12884 states. [2025-04-13 23:23:20,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12884 to 6771. [2025-04-13 23:23:20,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6771 states, 6770 states have (on average 3.655834564254062) internal successors, (24750), 6770 states have internal predecessors, (24750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6771 states to 6771 states and 24750 transitions. [2025-04-13 23:23:20,672 INFO L79 Accepts]: Start accepts. Automaton has 6771 states and 24750 transitions. Word has length 54 [2025-04-13 23:23:20,672 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:20,672 INFO L485 AbstractCegarLoop]: Abstraction has 6771 states and 24750 transitions. [2025-04-13 23:23:20,672 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:20,673 INFO L278 IsEmpty]: Start isEmpty. Operand 6771 states and 24750 transitions. [2025-04-13 23:23:20,684 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:20,684 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:20,684 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:20,684 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 23:23:20,684 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 23:23:20,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:20,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2048952989, now seen corresponding path program 26 times [2025-04-13 23:23:20,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:20,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027036348] [2025-04-13 23:23:20,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:20,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:20,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:20,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:20,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:23:20,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:21,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:21,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:21,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027036348] [2025-04-13 23:23:21,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027036348] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:21,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:21,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:21,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185301224] [2025-04-13 23:23:21,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:21,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:21,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:21,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:21,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:21,345 INFO L87 Difference]: Start difference. First operand 6771 states and 24750 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:22,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:22,223 INFO L93 Difference]: Finished difference Result 11085 states and 39401 transitions. [2025-04-13 23:23:22,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:22,224 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:23:22,224 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:22,267 INFO L225 Difference]: With dead ends: 11085 [2025-04-13 23:23:22,267 INFO L226 Difference]: Without dead ends: 11004 [2025-04-13 23:23:22,271 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:23:22,271 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 292 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:22,271 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 132 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:23:22,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11004 states. [2025-04-13 23:23:22,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11004 to 6760. [2025-04-13 23:23:22,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6760 states, 6759 states have (on average 3.6561621541648175) internal successors, (24712), 6759 states have internal predecessors, (24712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:22,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6760 states to 6760 states and 24712 transitions. [2025-04-13 23:23:22,426 INFO L79 Accepts]: Start accepts. Automaton has 6760 states and 24712 transitions. Word has length 54 [2025-04-13 23:23:22,427 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:22,427 INFO L485 AbstractCegarLoop]: Abstraction has 6760 states and 24712 transitions. [2025-04-13 23:23:22,427 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:22,427 INFO L278 IsEmpty]: Start isEmpty. Operand 6760 states and 24712 transitions. [2025-04-13 23:23:22,439 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:22,439 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:22,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:22,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 23:23:22,439 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 23:23:22,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:22,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1075220831, now seen corresponding path program 27 times [2025-04-13 23:23:22,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:22,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395618211] [2025-04-13 23:23:22,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:23:22,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:22,443 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:22,455 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:22,455 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:23:22,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:23,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 23:23:23,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:23,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395618211] [2025-04-13 23:23:23,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395618211] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:23,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:23,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:23,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354116439] [2025-04-13 23:23:23,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:23,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:23,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:23,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:23,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:23,115 INFO L87 Difference]: Start difference. First operand 6760 states and 24712 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:24,009 INFO L93 Difference]: Finished difference Result 12954 states and 45884 transitions. [2025-04-13 23:23:24,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:24,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 23:23:24,009 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:24,054 INFO L225 Difference]: With dead ends: 12954 [2025-04-13 23:23:24,054 INFO L226 Difference]: Without dead ends: 12883 [2025-04-13 23:23:24,059 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 23:23:24,060 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 341 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:24,060 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 101 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1452 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:23:24,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12883 states. [2025-04-13 23:23:24,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12883 to 6771. [2025-04-13 23:23:24,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6771 states, 6770 states have (on average 3.654209748892171) internal successors, (24739), 6770 states have internal predecessors, (24739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:24,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6771 states to 6771 states and 24739 transitions. [2025-04-13 23:23:24,227 INFO L79 Accepts]: Start accepts. Automaton has 6771 states and 24739 transitions. Word has length 54 [2025-04-13 23:23:24,227 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:24,227 INFO L485 AbstractCegarLoop]: Abstraction has 6771 states and 24739 transitions. [2025-04-13 23:23:24,227 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:24,227 INFO L278 IsEmpty]: Start isEmpty. Operand 6771 states and 24739 transitions. [2025-04-13 23:23:24,239 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:24,239 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:24,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 23:23:24,239 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 23:23:24,239 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 23:23:24,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:24,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1353839601, now seen corresponding path program 28 times [2025-04-13 23:23:24,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:24,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806190710] [2025-04-13 23:23:24,240 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:24,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:24,243 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:23:24,255 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 23:23:24,255 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:24,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:24,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:24,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:24,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806190710] [2025-04-13 23:23:24,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806190710] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:24,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:24,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:24,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549316366] [2025-04-13 23:23:24,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:24,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:24,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:24,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:24,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:24,789 INFO L87 Difference]: Start difference. First operand 6771 states and 24739 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:25,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:25,751 INFO L93 Difference]: Finished difference Result 11015 states and 39212 transitions. [2025-04-13 23:23:25,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:25,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 23:23:25,751 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:25,790 INFO L225 Difference]: With dead ends: 11015 [2025-04-13 23:23:25,791 INFO L226 Difference]: Without dead ends: 10589 [2025-04-13 23:23:25,795 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:23:25,796 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 280 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 1589 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:25,796 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 136 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1589 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:23:25,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10589 states. [2025-04-13 23:23:25,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10589 to 6459. [2025-04-13 23:23:25,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6459 states, 6458 states have (on average 3.679002787240632) internal successors, (23759), 6458 states have internal predecessors, (23759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6459 states to 6459 states and 23759 transitions. [2025-04-13 23:23:25,940 INFO L79 Accepts]: Start accepts. Automaton has 6459 states and 23759 transitions. Word has length 54 [2025-04-13 23:23:25,941 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:25,941 INFO L485 AbstractCegarLoop]: Abstraction has 6459 states and 23759 transitions. [2025-04-13 23:23:25,941 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:25,941 INFO L278 IsEmpty]: Start isEmpty. Operand 6459 states and 23759 transitions. [2025-04-13 23:23:25,951 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:25,951 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:25,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:25,952 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 23:23:25,952 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 23:23:25,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:25,952 INFO L85 PathProgramCache]: Analyzing trace with hash 135085505, now seen corresponding path program 29 times [2025-04-13 23:23:25,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:25,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398839445] [2025-04-13 23:23:25,952 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:25,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:25,955 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:25,968 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:25,968 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:23:25,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:26,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 23:23:26,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:26,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398839445] [2025-04-13 23:23:26,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398839445] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:26,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:26,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:26,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404595911] [2025-04-13 23:23:26,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:26,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:26,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:26,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:26,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:26,697 INFO L87 Difference]: Start difference. First operand 6459 states and 23759 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:27,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:27,617 INFO L93 Difference]: Finished difference Result 12593 states and 44778 transitions. [2025-04-13 23:23:27,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:27,618 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:23:27,618 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:27,665 INFO L225 Difference]: With dead ends: 12593 [2025-04-13 23:23:27,665 INFO L226 Difference]: Without dead ends: 12512 [2025-04-13 23:23:27,670 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:23:27,670 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 323 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:27,670 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 100 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:23:27,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12512 states. [2025-04-13 23:23:27,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12512 to 6448. [2025-04-13 23:23:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6448 states, 6447 states have (on average 3.680316426244765) internal successors, (23727), 6447 states have internal predecessors, (23727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6448 states to 6448 states and 23727 transitions. [2025-04-13 23:23:27,869 INFO L79 Accepts]: Start accepts. Automaton has 6448 states and 23727 transitions. Word has length 54 [2025-04-13 23:23:27,869 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:27,869 INFO L485 AbstractCegarLoop]: Abstraction has 6448 states and 23727 transitions. [2025-04-13 23:23:27,869 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:27,870 INFO L278 IsEmpty]: Start isEmpty. Operand 6448 states and 23727 transitions. [2025-04-13 23:23:27,881 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:27,881 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:27,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:27,881 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 23:23:27,881 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 23:23:27,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:27,882 INFO L85 PathProgramCache]: Analyzing trace with hash -625989831, now seen corresponding path program 30 times [2025-04-13 23:23:27,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:27,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806038896] [2025-04-13 23:23:27,882 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:27,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:27,885 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:27,896 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:27,896 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:23:27,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:28,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 23:23:28,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:28,515 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806038896] [2025-04-13 23:23:28,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806038896] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:28,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:28,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:28,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564323794] [2025-04-13 23:23:28,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:28,515 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:28,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:28,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:28,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:28,516 INFO L87 Difference]: Start difference. First operand 6448 states and 23727 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:29,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:29,442 INFO L93 Difference]: Finished difference Result 11466 states and 40643 transitions. [2025-04-13 23:23:29,442 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:29,442 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:23:29,442 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:29,480 INFO L225 Difference]: With dead ends: 11466 [2025-04-13 23:23:29,481 INFO L226 Difference]: Without dead ends: 11349 [2025-04-13 23:23:29,484 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:23:29,484 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 300 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:29,485 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 136 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:23:29,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11349 states. [2025-04-13 23:23:29,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11349 to 6643. [2025-04-13 23:23:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6643 states, 6642 states have (on average 3.6623005118940077) internal successors, (24325), 6642 states have internal predecessors, (24325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:29,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6643 states to 6643 states and 24325 transitions. [2025-04-13 23:23:29,646 INFO L79 Accepts]: Start accepts. Automaton has 6643 states and 24325 transitions. Word has length 54 [2025-04-13 23:23:29,646 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:29,646 INFO L485 AbstractCegarLoop]: Abstraction has 6643 states and 24325 transitions. [2025-04-13 23:23:29,646 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:29,646 INFO L278 IsEmpty]: Start isEmpty. Operand 6643 states and 24325 transitions. [2025-04-13 23:23:29,657 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:29,657 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:29,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 23:23:29,657 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 23:23:29,658 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 23:23:29,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:29,658 INFO L85 PathProgramCache]: Analyzing trace with hash 910815039, now seen corresponding path program 31 times [2025-04-13 23:23:29,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:29,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314088320] [2025-04-13 23:23:29,658 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:23:29,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:29,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:29,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:29,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:29,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:30,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:30,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314088320] [2025-04-13 23:23:30,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314088320] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:30,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:30,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:30,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813200141] [2025-04-13 23:23:30,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:30,331 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:30,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:30,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:30,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:30,331 INFO L87 Difference]: Start difference. First operand 6643 states and 24325 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:31,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:31,248 INFO L93 Difference]: Finished difference Result 12733 states and 45214 transitions. [2025-04-13 23:23:31,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:23:31,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 23:23:31,248 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:31,292 INFO L225 Difference]: With dead ends: 12733 [2025-04-13 23:23:31,292 INFO L226 Difference]: Without dead ends: 12665 [2025-04-13 23:23:31,297 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:23:31,297 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 314 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:31,297 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 99 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:23:31,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12665 states. [2025-04-13 23:23:31,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12665 to 6653. [2025-04-13 23:23:31,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6653 states, 6652 states have (on average 3.6605532170775708) internal successors, (24350), 6652 states have internal predecessors, (24350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:31,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6653 states to 6653 states and 24350 transitions. [2025-04-13 23:23:31,457 INFO L79 Accepts]: Start accepts. Automaton has 6653 states and 24350 transitions. Word has length 54 [2025-04-13 23:23:31,457 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:31,457 INFO L485 AbstractCegarLoop]: Abstraction has 6653 states and 24350 transitions. [2025-04-13 23:23:31,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 23:23:31,458 INFO L278 IsEmpty]: Start isEmpty. Operand 6653 states and 24350 transitions. [2025-04-13 23:23:31,468 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:31,469 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:31,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 23:23:31,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 23:23:31,469 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 23:23:31,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:31,469 INFO L85 PathProgramCache]: Analyzing trace with hash -828618857, now seen corresponding path program 32 times [2025-04-13 23:23:31,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:31,469 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016308737] [2025-04-13 23:23:31,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:31,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:31,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:31,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:31,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:23:31,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:32,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:32,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:32,124 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016308737] [2025-04-13 23:23:32,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016308737] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:32,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:32,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:32,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478094971] [2025-04-13 23:23:32,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:32,124 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:32,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:32,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:32,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:32,125 INFO L87 Difference]: Start difference. First operand 6653 states and 24350 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:33,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:33,027 INFO L93 Difference]: Finished difference Result 11511 states and 40728 transitions. [2025-04-13 23:23:33,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:33,027 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:23:33,027 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:33,066 INFO L225 Difference]: With dead ends: 11511 [2025-04-13 23:23:33,066 INFO L226 Difference]: Without dead ends: 11440 [2025-04-13 23:23:33,070 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:23:33,070 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 313 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 1554 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:33,070 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 130 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1554 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:23:33,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11440 states. [2025-04-13 23:23:33,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11440 to 6664. [2025-04-13 23:23:33,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6664 states, 6663 states have (on average 3.6585622092150683) internal successors, (24377), 6663 states have internal predecessors, (24377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:33,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6664 states to 6664 states and 24377 transitions. [2025-04-13 23:23:33,233 INFO L79 Accepts]: Start accepts. Automaton has 6664 states and 24377 transitions. Word has length 54 [2025-04-13 23:23:33,233 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:33,233 INFO L485 AbstractCegarLoop]: Abstraction has 6664 states and 24377 transitions. [2025-04-13 23:23:33,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 23:23:33,234 INFO L278 IsEmpty]: Start isEmpty. Operand 6664 states and 24377 transitions. [2025-04-13 23:23:33,246 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:33,246 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:33,246 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:33,246 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 23:23:33,246 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 23:23:33,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:33,247 INFO L85 PathProgramCache]: Analyzing trace with hash 140337057, now seen corresponding path program 33 times [2025-04-13 23:23:33,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:33,247 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564129692] [2025-04-13 23:23:33,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:23:33,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:33,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:33,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:33,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:23:33,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:33,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:33,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:33,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564129692] [2025-04-13 23:23:33,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564129692] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:33,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:33,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:33,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305053594] [2025-04-13 23:23:33,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:33,919 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:33,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:33,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:33,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:33,919 INFO L87 Difference]: Start difference. First operand 6664 states and 24377 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:34,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:34,929 INFO L93 Difference]: Finished difference Result 12698 states and 45123 transitions. [2025-04-13 23:23:34,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:34,929 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:23:34,929 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:34,977 INFO L225 Difference]: With dead ends: 12698 [2025-04-13 23:23:34,977 INFO L226 Difference]: Without dead ends: 12613 [2025-04-13 23:23:34,981 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:23:34,982 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 266 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:34,982 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 113 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1580 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:23:34,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12613 states. [2025-04-13 23:23:35,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12613 to 6649. [2025-04-13 23:23:35,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6649 states, 6648 states have (on average 3.660800240673887) internal successors, (24337), 6648 states have internal predecessors, (24337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:35,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 24337 transitions. [2025-04-13 23:23:35,140 INFO L79 Accepts]: Start accepts. Automaton has 6649 states and 24337 transitions. Word has length 54 [2025-04-13 23:23:35,140 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:35,140 INFO L485 AbstractCegarLoop]: Abstraction has 6649 states and 24337 transitions. [2025-04-13 23:23:35,140 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:35,140 INFO L278 IsEmpty]: Start isEmpty. Operand 6649 states and 24337 transitions. [2025-04-13 23:23:35,152 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:35,152 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:35,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 23:23:35,153 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 23:23:35,153 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 23:23:35,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:35,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1931518467, now seen corresponding path program 34 times [2025-04-13 23:23:35,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:35,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380662137] [2025-04-13 23:23:35,153 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:35,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:35,156 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:23:35,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 23:23:35,173 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:35,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:35,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:35,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:35,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380662137] [2025-04-13 23:23:35,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380662137] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:35,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:35,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:35,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921456137] [2025-04-13 23:23:35,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:35,745 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:35,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:35,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:35,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:35,746 INFO L87 Difference]: Start difference. First operand 6649 states and 24337 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:36,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:36,483 INFO L93 Difference]: Finished difference Result 11425 states and 40497 transitions. [2025-04-13 23:23:36,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23: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 23:23:36,484 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:36,528 INFO L225 Difference]: With dead ends: 11425 [2025-04-13 23:23:36,528 INFO L226 Difference]: Without dead ends: 11322 [2025-04-13 23:23:36,532 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:23:36,532 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 296 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:36,533 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 121 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:23:36,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11322 states. [2025-04-13 23:23:36,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11322 to 6616. [2025-04-13 23:23:36,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6616 states, 6615 states have (on average 3.6634920634920634) internal successors, (24234), 6615 states have internal predecessors, (24234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6616 states to 6616 states and 24234 transitions. [2025-04-13 23:23:36,696 INFO L79 Accepts]: Start accepts. Automaton has 6616 states and 24234 transitions. Word has length 54 [2025-04-13 23:23:36,697 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:36,697 INFO L485 AbstractCegarLoop]: Abstraction has 6616 states and 24234 transitions. [2025-04-13 23:23:36,697 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:36,697 INFO L278 IsEmpty]: Start isEmpty. Operand 6616 states and 24234 transitions. [2025-04-13 23:23:36,708 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:36,708 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:36,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:36,708 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 23:23:36,708 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 23:23:36,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:36,708 INFO L85 PathProgramCache]: Analyzing trace with hash 747052355, now seen corresponding path program 35 times [2025-04-13 23:23:36,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:36,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452872026] [2025-04-13 23:23:36,709 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:36,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:36,712 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:36,724 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:36,724 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:23:36,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:37,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 23:23:37,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:37,409 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452872026] [2025-04-13 23:23:37,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452872026] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:37,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:37,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:37,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309874719] [2025-04-13 23:23:37,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:37,409 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:37,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:37,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:37,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:37,410 INFO L87 Difference]: Start difference. First operand 6616 states and 24234 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:38,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:38,332 INFO L93 Difference]: Finished difference Result 12790 states and 45372 transitions. [2025-04-13 23:23:38,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:38,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 23:23:38,332 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:38,374 INFO L225 Difference]: With dead ends: 12790 [2025-04-13 23:23:38,374 INFO L226 Difference]: Without dead ends: 12673 [2025-04-13 23:23:38,379 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 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 23:23:38,379 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 320 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:38,379 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 111 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:23:38,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12673 states. [2025-04-13 23:23:38,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12673 to 6638. [2025-04-13 23:23:38,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6638 states, 6637 states have (on average 3.6594847069459093) internal successors, (24288), 6637 states have internal predecessors, (24288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:38,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6638 states to 6638 states and 24288 transitions. [2025-04-13 23:23:38,545 INFO L79 Accepts]: Start accepts. Automaton has 6638 states and 24288 transitions. Word has length 54 [2025-04-13 23:23:38,545 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:38,545 INFO L485 AbstractCegarLoop]: Abstraction has 6638 states and 24288 transitions. [2025-04-13 23:23:38,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:38,546 INFO L278 IsEmpty]: Start isEmpty. Operand 6638 states and 24288 transitions. [2025-04-13 23:23:38,556 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:38,557 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:38,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 23:23:38,557 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 23:23:38,557 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 23:23:38,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:38,557 INFO L85 PathProgramCache]: Analyzing trace with hash -774281351, now seen corresponding path program 36 times [2025-04-13 23:23:38,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:38,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853612194] [2025-04-13 23:23:38,557 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:38,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:38,561 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:38,572 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:38,572 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:23:38,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:39,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:39,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853612194] [2025-04-13 23:23:39,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853612194] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:39,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:39,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:39,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116636756] [2025-04-13 23:23:39,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:39,228 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:39,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:39,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:39,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:39,228 INFO L87 Difference]: Start difference. First operand 6638 states and 24288 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:40,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:40,208 INFO L93 Difference]: Finished difference Result 11436 states and 40513 transitions. [2025-04-13 23:23:40,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:40,208 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:23:40,209 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:40,248 INFO L225 Difference]: With dead ends: 11436 [2025-04-13 23:23:40,248 INFO L226 Difference]: Without dead ends: 11365 [2025-04-13 23:23:40,252 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 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 23:23:40,252 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 301 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:40,252 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 153 Invalid, 1818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1801 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:23:40,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11365 states. [2025-04-13 23:23:40,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11365 to 6671. [2025-04-13 23:23:40,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6671 states, 6670 states have (on average 3.6568215892053972) internal successors, (24391), 6670 states have internal predecessors, (24391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6671 states to 6671 states and 24391 transitions. [2025-04-13 23:23:40,412 INFO L79 Accepts]: Start accepts. Automaton has 6671 states and 24391 transitions. Word has length 54 [2025-04-13 23:23:40,412 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:40,412 INFO L485 AbstractCegarLoop]: Abstraction has 6671 states and 24391 transitions. [2025-04-13 23:23:40,412 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:40,412 INFO L278 IsEmpty]: Start isEmpty. Operand 6671 states and 24391 transitions. [2025-04-13 23:23:40,424 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:40,424 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:40,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:40,424 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 23:23:40,424 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 23:23:40,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:40,424 INFO L85 PathProgramCache]: Analyzing trace with hash -688015135, now seen corresponding path program 37 times [2025-04-13 23:23:40,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:40,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452545933] [2025-04-13 23:23:40,425 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:23:40,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:40,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:40,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:40,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:40,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:41,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 23:23:41,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:41,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452545933] [2025-04-13 23:23:41,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452545933] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:41,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:41,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:41,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200984049] [2025-04-13 23:23:41,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:41,058 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:41,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:41,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:41,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:41,058 INFO L87 Difference]: Start difference. First operand 6671 states and 24391 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:42,026 INFO L93 Difference]: Finished difference Result 12787 states and 45355 transitions. [2025-04-13 23:23:42,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:42,026 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:23:42,026 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:42,070 INFO L225 Difference]: With dead ends: 12787 [2025-04-13 23:23:42,070 INFO L226 Difference]: Without dead ends: 12716 [2025-04-13 23:23:42,075 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 23:23:42,076 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 309 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:42,076 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 106 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:23:42,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12716 states. [2025-04-13 23:23:42,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12716 to 6671. [2025-04-13 23:23:42,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6671 states, 6670 states have (on average 3.6568215892053972) internal successors, (24391), 6670 states have internal predecessors, (24391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:42,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6671 states to 6671 states and 24391 transitions. [2025-04-13 23:23:42,239 INFO L79 Accepts]: Start accepts. Automaton has 6671 states and 24391 transitions. Word has length 54 [2025-04-13 23:23:42,239 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:42,239 INFO L485 AbstractCegarLoop]: Abstraction has 6671 states and 24391 transitions. [2025-04-13 23:23:42,239 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:42,239 INFO L278 IsEmpty]: Start isEmpty. Operand 6671 states and 24391 transitions. [2025-04-13 23:23:42,250 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:42,250 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:42,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 23:23:42,250 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 23:23:42,251 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 23:23:42,251 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:42,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1985855973, now seen corresponding path program 38 times [2025-04-13 23:23:42,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:42,251 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603296514] [2025-04-13 23:23:42,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:42,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:42,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:42,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:42,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:23:42,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:42,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:42,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:42,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603296514] [2025-04-13 23:23:42,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603296514] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:42,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:42,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:42,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564664572] [2025-04-13 23:23:42,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:42,845 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:42,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:42,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:42,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:42,846 INFO L87 Difference]: Start difference. First operand 6671 states and 24391 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:43,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:43,795 INFO L93 Difference]: Finished difference Result 11446 states and 40527 transitions. [2025-04-13 23:23:43,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:43,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 23:23:43,796 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:43,838 INFO L225 Difference]: With dead ends: 11446 [2025-04-13 23:23:43,838 INFO L226 Difference]: Without dead ends: 11365 [2025-04-13 23:23:43,843 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:23:43,843 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 302 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:43,843 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 128 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:23:43,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11365 states. [2025-04-13 23:23:43,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11365 to 6671. [2025-04-13 23:23:44,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6671 states, 6670 states have (on average 3.6551724137931036) internal successors, (24380), 6670 states have internal predecessors, (24380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:44,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6671 states to 6671 states and 24380 transitions. [2025-04-13 23:23:44,056 INFO L79 Accepts]: Start accepts. Automaton has 6671 states and 24380 transitions. Word has length 54 [2025-04-13 23:23:44,057 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:44,057 INFO L485 AbstractCegarLoop]: Abstraction has 6671 states and 24380 transitions. [2025-04-13 23:23:44,057 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:44,057 INFO L278 IsEmpty]: Start isEmpty. Operand 6671 states and 24380 transitions. [2025-04-13 23:23:44,068 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:44,068 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:44,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:44,068 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-13 23:23:44,068 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 23:23:44,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:44,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1628150461, now seen corresponding path program 39 times [2025-04-13 23:23:44,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:44,069 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333416490] [2025-04-13 23:23:44,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:23:44,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:44,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:44,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:44,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:23:44,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:44,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 23:23:44,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:44,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333416490] [2025-04-13 23:23:44,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333416490] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:44,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:44,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:44,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535395428] [2025-04-13 23:23:44,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:44,701 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:44,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:44,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:44,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:44,702 INFO L87 Difference]: Start difference. First operand 6671 states and 24380 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:45,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:45,679 INFO L93 Difference]: Finished difference Result 12705 states and 45126 transitions. [2025-04-13 23:23:45,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:45,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 23:23:45,679 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:45,730 INFO L225 Difference]: With dead ends: 12705 [2025-04-13 23:23:45,731 INFO L226 Difference]: Without dead ends: 12592 [2025-04-13 23:23:45,736 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 23:23:45,736 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 272 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:45,736 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 112 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:23:45,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12592 states. [2025-04-13 23:23:45,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12592 to 6628. [2025-04-13 23:23:45,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6628 states, 6627 states have (on average 3.6613852421910367) internal successors, (24264), 6627 states have internal predecessors, (24264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6628 states to 6628 states and 24264 transitions. [2025-04-13 23:23:45,913 INFO L79 Accepts]: Start accepts. Automaton has 6628 states and 24264 transitions. Word has length 54 [2025-04-13 23:23:45,914 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:45,914 INFO L485 AbstractCegarLoop]: Abstraction has 6628 states and 24264 transitions. [2025-04-13 23:23:45,914 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:45,914 INFO L278 IsEmpty]: Start isEmpty. Operand 6628 states and 24264 transitions. [2025-04-13 23:23:45,925 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:45,925 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:45,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:45,925 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 23:23:45,926 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 23:23:45,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:45,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1093681267, now seen corresponding path program 40 times [2025-04-13 23:23:45,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:45,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201234266] [2025-04-13 23:23:45,926 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:45,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:45,929 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:23:45,943 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 23:23:45,943 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:45,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:46,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:46,476 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201234266] [2025-04-13 23:23:46,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201234266] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:46,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:46,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:46,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876372057] [2025-04-13 23:23:46,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:46,477 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:46,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:46,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:46,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:46,477 INFO L87 Difference]: Start difference. First operand 6628 states and 24264 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:47,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:47,255 INFO L93 Difference]: Finished difference Result 11322 states and 40195 transitions. [2025-04-13 23:23:47,255 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:47,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 23:23:47,255 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:47,296 INFO L225 Difference]: With dead ends: 11322 [2025-04-13 23:23:47,296 INFO L226 Difference]: Without dead ends: 11043 [2025-04-13 23:23:47,300 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:23:47,301 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 259 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:47,301 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 139 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1639 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:23:47,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11043 states. [2025-04-13 23:23:47,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11043 to 6463. [2025-04-13 23:23:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6463 states, 6462 states have (on average 3.675642216032188) internal successors, (23752), 6462 states have internal predecessors, (23752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:47,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6463 states to 6463 states and 23752 transitions. [2025-04-13 23:23:47,456 INFO L79 Accepts]: Start accepts. Automaton has 6463 states and 23752 transitions. Word has length 54 [2025-04-13 23:23:47,457 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:47,457 INFO L485 AbstractCegarLoop]: Abstraction has 6463 states and 23752 transitions. [2025-04-13 23:23:47,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 23:23:47,457 INFO L278 IsEmpty]: Start isEmpty. Operand 6463 states and 23752 transitions. [2025-04-13 23:23:47,468 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:47,468 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:47,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:47,468 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-13 23:23:47,468 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 23:23:47,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:47,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1243794849, now seen corresponding path program 41 times [2025-04-13 23:23:47,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:47,469 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978874193] [2025-04-13 23:23:47,469 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:47,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:47,472 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:47,484 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:47,484 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:23:47,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:48,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 23:23:48,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:48,116 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978874193] [2025-04-13 23:23:48,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978874193] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:48,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:48,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:48,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488368327] [2025-04-13 23:23:48,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:48,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:48,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:48,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:48,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:48,116 INFO L87 Difference]: Start difference. First operand 6463 states and 23752 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:48,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:48,979 INFO L93 Difference]: Finished difference Result 12610 states and 44813 transitions. [2025-04-13 23:23:48,980 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:48,980 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:23:48,980 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:49,024 INFO L225 Difference]: With dead ends: 12610 [2025-04-13 23:23:49,024 INFO L226 Difference]: Without dead ends: 12539 [2025-04-13 23:23:49,034 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 23:23:49,034 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 313 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:49,034 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 103 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1422 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:23:49,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12539 states. [2025-04-13 23:23:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12539 to 6488. [2025-04-13 23:23:49,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6488 states, 6487 states have (on average 3.674579929088947) internal successors, (23837), 6487 states have internal predecessors, (23837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6488 states to 6488 states and 23837 transitions. [2025-04-13 23:23:49,206 INFO L79 Accepts]: Start accepts. Automaton has 6488 states and 23837 transitions. Word has length 54 [2025-04-13 23:23:49,206 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:49,206 INFO L485 AbstractCegarLoop]: Abstraction has 6488 states and 23837 transitions. [2025-04-13 23:23:49,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 23:23:49,206 INFO L278 IsEmpty]: Start isEmpty. Operand 6488 states and 23837 transitions. [2025-04-13 23:23:49,217 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:49,217 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:49,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:49,217 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-13 23:23:49,217 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 23:23:49,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:49,218 INFO L85 PathProgramCache]: Analyzing trace with hash 543723151, now seen corresponding path program 42 times [2025-04-13 23:23:49,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:49,218 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780334665] [2025-04-13 23:23:49,218 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:49,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:49,221 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:49,231 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:49,231 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:23:49,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:49,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 23:23:49,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:49,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780334665] [2025-04-13 23:23:49,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780334665] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:49,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:49,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:49,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50550902] [2025-04-13 23:23:49,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:49,765 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:49,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:49,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:49,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:49,765 INFO L87 Difference]: Start difference. First operand 6488 states and 23837 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:50,822 INFO L93 Difference]: Finished difference Result 11247 states and 40013 transitions. [2025-04-13 23:23:50,822 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:50,822 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:23:50,823 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:50,872 INFO L225 Difference]: With dead ends: 11247 [2025-04-13 23:23:50,872 INFO L226 Difference]: Without dead ends: 11179 [2025-04-13 23:23:50,876 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:23:50,877 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 309 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1730 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:50,877 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 144 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1730 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:23:50,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11179 states. [2025-04-13 23:23:51,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11179 to 6563. [2025-04-13 23:23:51,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6563 states, 6562 states have (on average 3.672965559280707) internal successors, (24102), 6562 states have internal predecessors, (24102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6563 states to 6563 states and 24102 transitions. [2025-04-13 23:23:51,076 INFO L79 Accepts]: Start accepts. Automaton has 6563 states and 24102 transitions. Word has length 54 [2025-04-13 23:23:51,076 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:51,076 INFO L485 AbstractCegarLoop]: Abstraction has 6563 states and 24102 transitions. [2025-04-13 23:23:51,076 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:51,076 INFO L278 IsEmpty]: Start isEmpty. Operand 6563 states and 24102 transitions. [2025-04-13 23:23:51,087 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:51,088 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:51,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:51,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-13 23:23:51,088 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 23:23:51,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:51,089 INFO L85 PathProgramCache]: Analyzing trace with hash -443790273, now seen corresponding path program 43 times [2025-04-13 23:23:51,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:51,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619212013] [2025-04-13 23:23:51,089 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:23:51,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:51,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:51,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:51,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:51,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:51,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 23:23:51,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:51,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619212013] [2025-04-13 23:23:51,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619212013] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:51,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:51,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:51,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589298761] [2025-04-13 23:23:51,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:51,700 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:51,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:51,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:51,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:51,700 INFO L87 Difference]: Start difference. First operand 6563 states and 24102 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:52,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:52,613 INFO L93 Difference]: Finished difference Result 12682 states and 45061 transitions. [2025-04-13 23:23:52,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:52,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 23:23:52,613 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:52,663 INFO L225 Difference]: With dead ends: 12682 [2025-04-13 23:23:52,663 INFO L226 Difference]: Without dead ends: 12604 [2025-04-13 23:23:52,669 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 23:23:52,669 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 282 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1611 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:52,669 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 116 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1611 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:23:52,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12604 states. [2025-04-13 23:23:52,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12604 to 6553. [2025-04-13 23:23:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6553 states, 6552 states have (on average 3.673992673992674) internal successors, (24072), 6552 states have internal predecessors, (24072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:52,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6553 states to 6553 states and 24072 transitions. [2025-04-13 23:23:52,870 INFO L79 Accepts]: Start accepts. Automaton has 6553 states and 24072 transitions. Word has length 54 [2025-04-13 23:23:52,870 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:52,870 INFO L485 AbstractCegarLoop]: Abstraction has 6553 states and 24072 transitions. [2025-04-13 23:23:52,870 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:52,871 INFO L278 IsEmpty]: Start isEmpty. Operand 6553 states and 24072 transitions. [2025-04-13 23:23:52,884 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:52,884 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:52,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:52,884 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-13 23:23:52,884 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 23:23:52,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:52,885 INFO L85 PathProgramCache]: Analyzing trace with hash -256281425, now seen corresponding path program 44 times [2025-04-13 23:23:52,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:52,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162026158] [2025-04-13 23:23:52,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:52,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:52,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:52,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:52,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:23:52,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:53,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 23:23:53,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:53,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162026158] [2025-04-13 23:23:53,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162026158] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:53,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:53,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:53,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535882926] [2025-04-13 23:23:53,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:53,575 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:53,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:53,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:53,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:53,575 INFO L87 Difference]: Start difference. First operand 6553 states and 24072 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:54,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:54,433 INFO L93 Difference]: Finished difference Result 11240 states and 39980 transitions. [2025-04-13 23:23:54,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:54,434 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:23:54,434 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:54,482 INFO L225 Difference]: With dead ends: 11240 [2025-04-13 23:23:54,482 INFO L226 Difference]: Without dead ends: 11159 [2025-04-13 23:23:54,487 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:23:54,488 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 311 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:54,488 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 134 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1620 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:23:54,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11159 states. [2025-04-13 23:23:54,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11159 to 6543. [2025-04-13 23:23:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6543 states, 6542 states have (on average 3.6742586365025987) internal successors, (24037), 6542 states have internal predecessors, (24037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6543 states to 6543 states and 24037 transitions. [2025-04-13 23:23:54,674 INFO L79 Accepts]: Start accepts. Automaton has 6543 states and 24037 transitions. Word has length 54 [2025-04-13 23:23:54,674 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:54,674 INFO L485 AbstractCegarLoop]: Abstraction has 6543 states and 24037 transitions. [2025-04-13 23:23:54,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 23:23:54,674 INFO L278 IsEmpty]: Start isEmpty. Operand 6543 states and 24037 transitions. [2025-04-13 23:23:54,686 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:54,687 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:54,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 23:23:54,687 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-04-13 23:23:54,687 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 23:23:54,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:54,687 INFO L85 PathProgramCache]: Analyzing trace with hash 641191485, now seen corresponding path program 45 times [2025-04-13 23:23:54,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:54,687 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645118454] [2025-04-13 23:23:54,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:23:54,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:54,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:54,703 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:54,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:23:54,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:55,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:55,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645118454] [2025-04-13 23:23:55,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645118454] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:55,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:55,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:55,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547489648] [2025-04-13 23:23:55,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:55,330 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:55,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:55,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:55,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:55,331 INFO L87 Difference]: Start difference. First operand 6543 states and 24037 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:56,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:56,278 INFO L93 Difference]: Finished difference Result 12746 states and 45219 transitions. [2025-04-13 23:23:56,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:56,278 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:23:56,278 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:56,328 INFO L225 Difference]: With dead ends: 12746 [2025-04-13 23:23:56,328 INFO L226 Difference]: Without dead ends: 12675 [2025-04-13 23:23:56,333 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 23:23:56,333 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 311 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:56,333 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 115 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:23:56,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12675 states. [2025-04-13 23:23:56,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12675 to 6554. [2025-04-13 23:23:56,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6554 states, 6553 states have (on average 3.672211200976652) internal successors, (24064), 6553 states have internal predecessors, (24064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:56,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6554 states to 6554 states and 24064 transitions. [2025-04-13 23:23:56,522 INFO L79 Accepts]: Start accepts. Automaton has 6554 states and 24064 transitions. Word has length 54 [2025-04-13 23:23:56,523 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:56,523 INFO L485 AbstractCegarLoop]: Abstraction has 6554 states and 24064 transitions. [2025-04-13 23:23:56,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 23:23:56,523 INFO L278 IsEmpty]: Start isEmpty. Operand 6554 states and 24064 transitions. [2025-04-13 23:23:56,535 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:56,536 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:56,536 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:56,536 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-13 23:23:56,536 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 23:23:56,536 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:56,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1458082993, now seen corresponding path program 46 times [2025-04-13 23:23:56,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:56,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722822834] [2025-04-13 23:23:56,536 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:56,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:56,540 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:23:56,552 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 23:23:56,552 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:56,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:57,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 23:23:57,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:57,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722822834] [2025-04-13 23:23:57,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722822834] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:57,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:57,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:57,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280379931] [2025-04-13 23:23:57,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:57,278 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:57,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:57,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:57,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:57,279 INFO L87 Difference]: Start difference. First operand 6554 states and 24064 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:58,321 INFO L93 Difference]: Finished difference Result 11287 states and 40106 transitions. [2025-04-13 23:23:58,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:23:58,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 23:23:58,321 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:58,365 INFO L225 Difference]: With dead ends: 11287 [2025-04-13 23:23:58,365 INFO L226 Difference]: Without dead ends: 11150 [2025-04-13 23:23:58,369 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:23:58,370 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 339 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:58,370 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 133 Invalid, 1655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:23:58,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11150 states. [2025-04-13 23:23:58,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11150 to 6534. [2025-04-13 23:23:58,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6534 states, 6533 states have (on average 3.6727384050206644) internal successors, (23994), 6533 states have internal predecessors, (23994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:58,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6534 states to 6534 states and 23994 transitions. [2025-04-13 23:23:58,536 INFO L79 Accepts]: Start accepts. Automaton has 6534 states and 23994 transitions. Word has length 54 [2025-04-13 23:23:58,538 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:58,538 INFO L485 AbstractCegarLoop]: Abstraction has 6534 states and 23994 transitions. [2025-04-13 23:23:58,538 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:58,538 INFO L278 IsEmpty]: Start isEmpty. Operand 6534 states and 23994 transitions. [2025-04-13 23:23:58,549 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:23:58,550 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:58,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 23:23:58,550 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-04-13 23:23:58,550 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 23:23:58,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:58,550 INFO L85 PathProgramCache]: Analyzing trace with hash -298943841, now seen corresponding path program 47 times [2025-04-13 23:23:58,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:58,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19341876] [2025-04-13 23:23:58,550 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:58,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:58,553 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:23:58,568 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:23:58,568 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:23:58,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:59,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 23:23:59,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:59,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19341876] [2025-04-13 23:23:59,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19341876] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:59,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:59,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:23:59,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163551360] [2025-04-13 23:23:59,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:59,204 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:23:59,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:59,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:23:59,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:23:59,204 INFO L87 Difference]: Start difference. First operand 6534 states and 23994 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:00,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:00,158 INFO L93 Difference]: Finished difference Result 12677 states and 45023 transitions. [2025-04-13 23:24:00,158 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:00,159 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:24:00,159 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:00,205 INFO L225 Difference]: With dead ends: 12677 [2025-04-13 23:24:00,205 INFO L226 Difference]: Without dead ends: 12596 [2025-04-13 23:24:00,207 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:24:00,207 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 307 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:00,207 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 100 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:24:00,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12596 states. [2025-04-13 23:24:00,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12596 to 6523. [2025-04-13 23:24:00,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6523 states, 6522 states have (on average 3.6740263722784423) internal successors, (23962), 6522 states have internal predecessors, (23962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6523 states to 6523 states and 23962 transitions. [2025-04-13 23:24:00,360 INFO L79 Accepts]: Start accepts. Automaton has 6523 states and 23962 transitions. Word has length 54 [2025-04-13 23:24:00,361 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:00,361 INFO L485 AbstractCegarLoop]: Abstraction has 6523 states and 23962 transitions. [2025-04-13 23:24:00,361 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:00,361 INFO L278 IsEmpty]: Start isEmpty. Operand 6523 states and 23962 transitions. [2025-04-13 23:24:00,371 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:00,372 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:00,372 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:00,372 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-04-13 23:24:00,372 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 23:24:00,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:00,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1734648177, now seen corresponding path program 48 times [2025-04-13 23:24:00,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:00,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283490665] [2025-04-13 23:24:00,372 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:24:00,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:00,375 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:00,386 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:00,386 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:24:00,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:00,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:00,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:00,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283490665] [2025-04-13 23:24:00,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283490665] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:00,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:00,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:00,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373645266] [2025-04-13 23:24:00,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:00,917 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:00,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:00,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:00,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:00,918 INFO L87 Difference]: Start difference. First operand 6523 states and 23962 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:02,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:02,030 INFO L93 Difference]: Finished difference Result 11404 states and 40409 transitions. [2025-04-13 23:24:02,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:02,030 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:24:02,031 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:02,074 INFO L225 Difference]: With dead ends: 11404 [2025-04-13 23:24:02,074 INFO L226 Difference]: Without dead ends: 11336 [2025-04-13 23:24:02,078 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:24:02,078 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 332 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1758 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:02,079 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 147 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1758 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:24:02,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11336 states. [2025-04-13 23:24:02,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11336 to 6538. [2025-04-13 23:24:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6538 states, 6537 states have (on average 3.672479730763347) internal successors, (24007), 6537 states have internal predecessors, (24007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6538 states to 6538 states and 24007 transitions. [2025-04-13 23:24:02,238 INFO L79 Accepts]: Start accepts. Automaton has 6538 states and 24007 transitions. Word has length 54 [2025-04-13 23:24:02,239 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:02,239 INFO L485 AbstractCegarLoop]: Abstraction has 6538 states and 24007 transitions. [2025-04-13 23:24:02,239 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:02,239 INFO L278 IsEmpty]: Start isEmpty. Operand 6538 states and 24007 transitions. [2025-04-13 23:24:02,250 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:02,250 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:02,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 23:24:02,250 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-04-13 23:24:02,250 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 23:24:02,251 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:02,251 INFO L85 PathProgramCache]: Analyzing trace with hash 476785693, now seen corresponding path program 49 times [2025-04-13 23:24:02,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:02,251 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365528552] [2025-04-13 23:24:02,251 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:24:02,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:02,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:02,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:02,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:24:02,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:02,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:02,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:02,864 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365528552] [2025-04-13 23:24:02,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365528552] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:02,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:02,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:02,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107314451] [2025-04-13 23:24:02,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:02,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:02,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:02,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:02,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:02,865 INFO L87 Difference]: Start difference. First operand 6538 states and 24007 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:03,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:03,784 INFO L93 Difference]: Finished difference Result 12737 states and 45179 transitions. [2025-04-13 23:24:03,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:03,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 23:24:03,784 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:03,833 INFO L225 Difference]: With dead ends: 12737 [2025-04-13 23:24:03,833 INFO L226 Difference]: Without dead ends: 12669 [2025-04-13 23:24:03,838 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 23:24:03,838 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 330 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:03,838 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 111 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:24:03,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12669 states. [2025-04-13 23:24:03,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12669 to 6548. [2025-04-13 23:24:03,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6548 states, 6547 states have (on average 3.670688865129067) internal successors, (24032), 6547 states have internal predecessors, (24032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6548 states to 6548 states and 24032 transitions. [2025-04-13 23:24:04,000 INFO L79 Accepts]: Start accepts. Automaton has 6548 states and 24032 transitions. Word has length 54 [2025-04-13 23:24:04,001 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:04,001 INFO L485 AbstractCegarLoop]: Abstraction has 6548 states and 24032 transitions. [2025-04-13 23:24:04,001 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:04,001 INFO L278 IsEmpty]: Start isEmpty. Operand 6548 states and 24032 transitions. [2025-04-13 23:24:04,012 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:04,012 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:04,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 23:24:04,012 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-04-13 23:24:04,012 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 23:24:04,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:04,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1760314543, now seen corresponding path program 50 times [2025-04-13 23:24:04,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:04,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872497376] [2025-04-13 23:24:04,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:24:04,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:04,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:04,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:04,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:24:04,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:04,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:04,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:04,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872497376] [2025-04-13 23:24:04,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872497376] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:04,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:04,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:04,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428728415] [2025-04-13 23:24:04,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:04,626 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:04,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:04,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:04,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:04,626 INFO L87 Difference]: Start difference. First operand 6548 states and 24032 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:05,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:05,644 INFO L93 Difference]: Finished difference Result 11417 states and 40431 transitions. [2025-04-13 23:24:05,644 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:05,644 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:24:05,645 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:05,686 INFO L225 Difference]: With dead ends: 11417 [2025-04-13 23:24:05,686 INFO L226 Difference]: Without dead ends: 11336 [2025-04-13 23:24:05,690 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:24:05,691 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 374 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:05,691 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 127 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1556 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:24:05,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11336 states. [2025-04-13 23:24:05,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11336 to 6538. [2025-04-13 23:24:05,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6538 states, 6537 states have (on average 3.671714853908521) internal successors, (24002), 6537 states have internal predecessors, (24002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:05,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6538 states to 6538 states and 24002 transitions. [2025-04-13 23:24:05,851 INFO L79 Accepts]: Start accepts. Automaton has 6538 states and 24002 transitions. Word has length 54 [2025-04-13 23:24:05,852 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:05,852 INFO L485 AbstractCegarLoop]: Abstraction has 6538 states and 24002 transitions. [2025-04-13 23:24:05,852 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:05,852 INFO L278 IsEmpty]: Start isEmpty. Operand 6538 states and 24002 transitions. [2025-04-13 23:24:05,863 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:05,863 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:05,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:05,863 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-04-13 23:24:05,863 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 23:24:05,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:05,863 INFO L85 PathProgramCache]: Analyzing trace with hash -293692289, now seen corresponding path program 51 times [2025-04-13 23:24:05,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:05,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018467341] [2025-04-13 23:24:05,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:24:05,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:05,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:05,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:05,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:24:05,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:06,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:06,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018467341] [2025-04-13 23:24:06,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018467341] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:06,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:06,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:06,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807055863] [2025-04-13 23:24:06,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:06,508 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:06,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:06,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:06,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:06,509 INFO L87 Difference]: Start difference. First operand 6538 states and 24002 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:07,427 INFO L93 Difference]: Finished difference Result 12681 states and 45031 transitions. [2025-04-13 23:24:07,427 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:07,427 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:24:07,428 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:07,482 INFO L225 Difference]: With dead ends: 12681 [2025-04-13 23:24:07,482 INFO L226 Difference]: Without dead ends: 12596 [2025-04-13 23:24:07,488 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:24:07,489 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 323 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:07,489 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 89 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:24:07,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12596 states. [2025-04-13 23:24:07,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12596 to 6523. [2025-04-13 23:24:07,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6523 states, 6522 states have (on average 3.6740263722784423) internal successors, (23962), 6522 states have internal predecessors, (23962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:07,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6523 states to 6523 states and 23962 transitions. [2025-04-13 23:24:07,673 INFO L79 Accepts]: Start accepts. Automaton has 6523 states and 23962 transitions. Word has length 54 [2025-04-13 23:24:07,673 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:07,673 INFO L485 AbstractCegarLoop]: Abstraction has 6523 states and 23962 transitions. [2025-04-13 23:24:07,673 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:07,673 INFO L278 IsEmpty]: Start isEmpty. Operand 6523 states and 23962 transitions. [2025-04-13 23:24:07,685 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:07,685 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:07,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:07,685 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-04-13 23:24:07,686 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 23:24:07,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:07,686 INFO L85 PathProgramCache]: Analyzing trace with hash -814072211, now seen corresponding path program 52 times [2025-04-13 23:24:07,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:07,686 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890077999] [2025-04-13 23:24:07,686 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:24:07,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:07,690 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:24:07,701 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 23:24:07,701 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:24:07,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:08,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:08,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:08,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890077999] [2025-04-13 23:24:08,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890077999] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:08,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:08,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:08,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559237518] [2025-04-13 23:24:08,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:08,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:08,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:08,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:08,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:08,305 INFO L87 Difference]: Start difference. First operand 6523 states and 23962 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:09,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:09,353 INFO L93 Difference]: Finished difference Result 11298 states and 40114 transitions. [2025-04-13 23:24:09,353 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:24:09,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 23:24:09,354 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:09,399 INFO L225 Difference]: With dead ends: 11298 [2025-04-13 23:24:09,399 INFO L226 Difference]: Without dead ends: 11230 [2025-04-13 23:24:09,403 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:24:09,404 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 316 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 1790 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 1810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:09,404 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 152 Invalid, 1810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1790 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:24:09,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11230 states. [2025-04-13 23:24:09,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11230 to 6533. [2025-04-13 23:24:09,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6533 states, 6532 states have (on average 3.6722290263319044) internal successors, (23987), 6532 states have internal predecessors, (23987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:09,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6533 states to 6533 states and 23987 transitions. [2025-04-13 23:24:09,640 INFO L79 Accepts]: Start accepts. Automaton has 6533 states and 23987 transitions. Word has length 54 [2025-04-13 23:24:09,641 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:09,641 INFO L485 AbstractCegarLoop]: Abstraction has 6533 states and 23987 transitions. [2025-04-13 23:24:09,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 23:24:09,641 INFO L278 IsEmpty]: Start isEmpty. Operand 6533 states and 23987 transitions. [2025-04-13 23:24:09,652 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:09,652 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:09,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:09,652 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-04-13 23:24:09,652 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 23:24:09,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:09,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1040645425, now seen corresponding path program 53 times [2025-04-13 23:24:09,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:09,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881752607] [2025-04-13 23:24:09,653 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:24:09,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:09,656 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:09,668 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:09,668 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:24:09,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:10,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:10,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:10,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881752607] [2025-04-13 23:24:10,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881752607] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:10,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:10,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:10,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235861507] [2025-04-13 23:24:10,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:10,308 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:10,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:10,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:10,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:10,308 INFO L87 Difference]: Start difference. First operand 6533 states and 23987 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:11,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:11,102 INFO L93 Difference]: Finished difference Result 12720 states and 45157 transitions. [2025-04-13 23:24:11,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:11,103 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:24:11,103 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:11,150 INFO L225 Difference]: With dead ends: 12720 [2025-04-13 23:24:11,150 INFO L226 Difference]: Without dead ends: 12649 [2025-04-13 23:24:11,156 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:24:11,156 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 319 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:11,157 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 86 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:24:11,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12649 states. [2025-04-13 23:24:11,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12649 to 6566. [2025-04-13 23:24:11,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6566 states, 6565 states have (on average 3.6694592536176693) internal successors, (24090), 6565 states have internal predecessors, (24090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6566 states to 6566 states and 24090 transitions. [2025-04-13 23:24:11,345 INFO L79 Accepts]: Start accepts. Automaton has 6566 states and 24090 transitions. Word has length 54 [2025-04-13 23:24:11,345 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:11,345 INFO L485 AbstractCegarLoop]: Abstraction has 6566 states and 24090 transitions. [2025-04-13 23:24:11,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 23:24:11,346 INFO L278 IsEmpty]: Start isEmpty. Operand 6566 states and 24090 transitions. [2025-04-13 23:24:11,356 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:11,357 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:11,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:11,357 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-04-13 23:24:11,357 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 23:24:11,357 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:11,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1584550193, now seen corresponding path program 54 times [2025-04-13 23:24:11,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:11,357 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884440710] [2025-04-13 23:24:11,357 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:24:11,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:11,361 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:11,371 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:11,371 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:24:11,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:11,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:11,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884440710] [2025-04-13 23:24:11,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884440710] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:11,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:11,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:11,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330383852] [2025-04-13 23:24:11,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:11,966 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:11,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:11,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:11,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:11,967 INFO L87 Difference]: Start difference. First operand 6566 states and 24090 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:13,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:13,077 INFO L93 Difference]: Finished difference Result 11285 states and 40099 transitions. [2025-04-13 23:24:13,077 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:13,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 23:24:13,077 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:13,120 INFO L225 Difference]: With dead ends: 11285 [2025-04-13 23:24:13,120 INFO L226 Difference]: Without dead ends: 11205 [2025-04-13 23:24:13,125 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:24:13,125 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 285 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 1799 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:13,125 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 152 Invalid, 1816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1799 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:24:13,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11205 states. [2025-04-13 23:24:13,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11205 to 6556. [2025-04-13 23:24:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6556 states, 6555 states have (on average 3.670480549199085) internal successors, (24060), 6555 states have internal predecessors, (24060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:13,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6556 states to 6556 states and 24060 transitions. [2025-04-13 23:24:13,304 INFO L79 Accepts]: Start accepts. Automaton has 6556 states and 24060 transitions. Word has length 54 [2025-04-13 23:24:13,304 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:13,304 INFO L485 AbstractCegarLoop]: Abstraction has 6556 states and 24060 transitions. [2025-04-13 23:24:13,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:13,304 INFO L278 IsEmpty]: Start isEmpty. Operand 6556 states and 24060 transitions. [2025-04-13 23:24:13,318 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:13,318 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:13,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:13,319 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-04-13 23:24:13,319 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 23:24:13,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:13,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1980780751, now seen corresponding path program 55 times [2025-04-13 23:24:13,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:13,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280289641] [2025-04-13 23:24:13,319 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:24:13,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:13,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:13,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:13,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:24:13,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:14,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 23:24:14,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:14,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280289641] [2025-04-13 23:24:14,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280289641] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:14,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:14,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:14,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954283506] [2025-04-13 23:24:14,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:14,050 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:14,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:14,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:14,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:14,050 INFO L87 Difference]: Start difference. First operand 6556 states and 24060 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:14,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:14,944 INFO L93 Difference]: Finished difference Result 12709 states and 45114 transitions. [2025-04-13 23:24:14,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:14,944 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:24:14,944 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:14,994 INFO L225 Difference]: With dead ends: 12709 [2025-04-13 23:24:14,994 INFO L226 Difference]: Without dead ends: 12628 [2025-04-13 23:24:14,999 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:24:14,999 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 294 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:14,999 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 107 Invalid, 1528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:24:15,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12628 states. [2025-04-13 23:24:15,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12628 to 6545. [2025-04-13 23:24:15,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6545 states, 6544 states have (on average 3.670843520782396) internal successors, (24022), 6544 states have internal predecessors, (24022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:15,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6545 states to 6545 states and 24022 transitions. [2025-04-13 23:24:15,172 INFO L79 Accepts]: Start accepts. Automaton has 6545 states and 24022 transitions. Word has length 54 [2025-04-13 23:24:15,172 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:15,172 INFO L485 AbstractCegarLoop]: Abstraction has 6545 states and 24022 transitions. [2025-04-13 23:24:15,172 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:15,172 INFO L278 IsEmpty]: Start isEmpty. Operand 6545 states and 24022 transitions. [2025-04-13 23:24:15,183 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:15,183 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:15,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:15,184 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-04-13 23:24:15,184 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 23:24:15,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:15,184 INFO L85 PathProgramCache]: Analyzing trace with hash -649666419, now seen corresponding path program 56 times [2025-04-13 23:24:15,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:15,184 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196606994] [2025-04-13 23:24:15,184 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:24:15,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:15,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:15,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:15,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:24:15,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:15,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 23:24:15,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:15,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196606994] [2025-04-13 23:24:15,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196606994] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:15,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:15,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:15,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324757676] [2025-04-13 23:24:15,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:15,794 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:15,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:15,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:15,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:15,795 INFO L87 Difference]: Start difference. First operand 6545 states and 24022 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:16,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:16,832 INFO L93 Difference]: Finished difference Result 11346 states and 40249 transitions. [2025-04-13 23:24:16,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:16,832 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:24:16,832 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:16,877 INFO L225 Difference]: With dead ends: 11346 [2025-04-13 23:24:16,877 INFO L226 Difference]: Without dead ends: 11275 [2025-04-13 23:24:16,881 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:24:16,882 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 310 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 1825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:16,882 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 151 Invalid, 1825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:24:16,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11275 states. [2025-04-13 23:24:16,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11275 to 6556. [2025-04-13 23:24:17,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6556 states, 6555 states have (on average 3.6688024408848205) internal successors, (24049), 6555 states have internal predecessors, (24049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:17,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6556 states to 6556 states and 24049 transitions. [2025-04-13 23:24:17,037 INFO L79 Accepts]: Start accepts. Automaton has 6556 states and 24049 transitions. Word has length 54 [2025-04-13 23:24:17,038 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:17,038 INFO L485 AbstractCegarLoop]: Abstraction has 6556 states and 24049 transitions. [2025-04-13 23:24:17,038 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:17,038 INFO L278 IsEmpty]: Start isEmpty. Operand 6556 states and 24049 transitions. [2025-04-13 23:24:17,049 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:17,049 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:17,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 23:24:17,050 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-04-13 23:24:17,050 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 23:24:17,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:17,050 INFO L85 PathProgramCache]: Analyzing trace with hash -367214017, now seen corresponding path program 57 times [2025-04-13 23:24:17,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:17,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73191328] [2025-04-13 23:24:17,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:24:17,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:17,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:17,065 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:17,066 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:24:17,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:17,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 23:24:17,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:17,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73191328] [2025-04-13 23:24:17,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73191328] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:17,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:17,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:17,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755292627] [2025-04-13 23:24:17,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:17,667 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:17,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:17,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:17,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:17,668 INFO L87 Difference]: Start difference. First operand 6556 states and 24049 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:18,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:18,542 INFO L93 Difference]: Finished difference Result 12683 states and 45055 transitions. [2025-04-13 23:24:18,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:18,542 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:24:18,542 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:18,599 INFO L225 Difference]: With dead ends: 12683 [2025-04-13 23:24:18,599 INFO L226 Difference]: Without dead ends: 12547 [2025-04-13 23:24:18,605 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:24:18,605 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 272 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:18,605 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 95 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:24:18,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12547 states. [2025-04-13 23:24:18,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12547 to 6534. [2025-04-13 23:24:18,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6534 states, 6533 states have (on average 3.6696770243379766) internal successors, (23974), 6533 states have internal predecessors, (23974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:18,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6534 states to 6534 states and 23974 transitions. [2025-04-13 23:24:18,847 INFO L79 Accepts]: Start accepts. Automaton has 6534 states and 23974 transitions. Word has length 54 [2025-04-13 23:24:18,848 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:18,848 INFO L485 AbstractCegarLoop]: Abstraction has 6534 states and 23974 transitions. [2025-04-13 23:24:18,848 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:18,848 INFO L278 IsEmpty]: Start isEmpty. Operand 6534 states and 23974 transitions. [2025-04-13 23:24:18,859 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:18,859 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:18,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 23:24:18,859 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-04-13 23:24:18,859 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 23:24:18,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:18,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1589801745, now seen corresponding path program 58 times [2025-04-13 23:24:18,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:18,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694172412] [2025-04-13 23:24:18,860 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:24:18,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:18,863 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:24:18,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 23:24:18,874 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:24:18,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:19,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 23:24:19,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:19,541 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694172412] [2025-04-13 23:24:19,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694172412] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:19,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:19,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:19,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538427259] [2025-04-13 23:24:19,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:19,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:19,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:19,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:19,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:19,542 INFO L87 Difference]: Start difference. First operand 6534 states and 23974 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:20,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:20,554 INFO L93 Difference]: Finished difference Result 11253 states and 39983 transitions. [2025-04-13 23:24:20,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:20,555 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:24:20,555 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:20,598 INFO L225 Difference]: With dead ends: 11253 [2025-04-13 23:24:20,598 INFO L226 Difference]: Without dead ends: 11167 [2025-04-13 23:24:20,602 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:24:20,602 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 290 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:20,602 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 144 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:24:20,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11167 states. [2025-04-13 23:24:20,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11167 to 6518. [2025-04-13 23:24:20,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6518 states, 6517 states have (on average 3.672241829062452) internal successors, (23932), 6517 states have internal predecessors, (23932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:20,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6518 states to 6518 states and 23932 transitions. [2025-04-13 23:24:20,757 INFO L79 Accepts]: Start accepts. Automaton has 6518 states and 23932 transitions. Word has length 54 [2025-04-13 23:24:20,757 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:20,757 INFO L485 AbstractCegarLoop]: Abstraction has 6518 states and 23932 transitions. [2025-04-13 23:24:20,757 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:20,758 INFO L278 IsEmpty]: Start isEmpty. Operand 6518 states and 23932 transitions. [2025-04-13 23:24:20,768 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:20,769 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:20,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 23:24:20,769 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-04-13 23:24:20,769 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 23:24:20,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:20,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1042253105, now seen corresponding path program 59 times [2025-04-13 23:24:20,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:20,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691176216] [2025-04-13 23:24:20,769 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:24:20,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:20,772 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:20,783 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:20,783 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:24:20,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:21,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:21,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691176216] [2025-04-13 23:24:21,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691176216] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:21,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:21,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:21,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555970629] [2025-04-13 23:24:21,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:21,403 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:21,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:21,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:21,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:21,403 INFO L87 Difference]: Start difference. First operand 6518 states and 23932 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:22,243 INFO L93 Difference]: Finished difference Result 12535 states and 44613 transitions. [2025-04-13 23:24:22,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:22,244 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:24:22,244 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:22,291 INFO L225 Difference]: With dead ends: 12535 [2025-04-13 23:24:22,291 INFO L226 Difference]: Without dead ends: 12467 [2025-04-13 23:24:22,297 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:24:22,297 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 273 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:22,297 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 108 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:24:22,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12467 states. [2025-04-13 23:24:22,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12467 to 6548. [2025-04-13 23:24:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6548 states, 6547 states have (on average 3.6699251565602564) internal successors, (24027), 6547 states have internal predecessors, (24027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:22,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6548 states to 6548 states and 24027 transitions. [2025-04-13 23:24:22,458 INFO L79 Accepts]: Start accepts. Automaton has 6548 states and 24027 transitions. Word has length 54 [2025-04-13 23:24:22,458 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:22,458 INFO L485 AbstractCegarLoop]: Abstraction has 6548 states and 24027 transitions. [2025-04-13 23:24:22,459 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:22,459 INFO L278 IsEmpty]: Start isEmpty. Operand 6548 states and 24027 transitions. [2025-04-13 23:24:22,470 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:22,470 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:22,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:22,470 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-04-13 23:24:22,470 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 23:24:22,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:22,470 INFO L85 PathProgramCache]: Analyzing trace with hash -977834895, now seen corresponding path program 60 times [2025-04-13 23:24:22,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:22,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228432670] [2025-04-13 23:24:22,470 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:24:22,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:22,474 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:22,484 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:22,484 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:24:22,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:23,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:23,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:23,121 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228432670] [2025-04-13 23:24:23,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228432670] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:23,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:23,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:23,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410034824] [2025-04-13 23:24:23,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:23,122 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:23,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:23,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:23,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:23,122 INFO L87 Difference]: Start difference. First operand 6548 states and 24027 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:24,078 INFO L93 Difference]: Finished difference Result 11407 states and 40428 transitions. [2025-04-13 23:24:24,078 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:24,079 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:24:24,079 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:24,121 INFO L225 Difference]: With dead ends: 11407 [2025-04-13 23:24:24,121 INFO L226 Difference]: Without dead ends: 11290 [2025-04-13 23:24:24,125 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:24:24,125 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 346 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1591 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:24,126 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 128 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:24:24,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11290 states. [2025-04-13 23:24:24,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11290 to 6570. [2025-04-13 23:24:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6570 states, 6569 states have (on average 3.665854772415893) internal successors, (24081), 6569 states have internal predecessors, (24081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:24,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6570 states to 6570 states and 24081 transitions. [2025-04-13 23:24:24,294 INFO L79 Accepts]: Start accepts. Automaton has 6570 states and 24081 transitions. Word has length 54 [2025-04-13 23:24:24,294 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:24,294 INFO L485 AbstractCegarLoop]: Abstraction has 6570 states and 24081 transitions. [2025-04-13 23:24:24,294 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:24,294 INFO L278 IsEmpty]: Start isEmpty. Operand 6570 states and 24081 transitions. [2025-04-13 23:24:24,307 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:24,307 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:24,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:24,307 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-04-13 23:24:24,307 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 23:24:24,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:24,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1812731087, now seen corresponding path program 61 times [2025-04-13 23:24:24,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:24,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499472413] [2025-04-13 23:24:24,308 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:24:24,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:24,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:24,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:24,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:24:24,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:24,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:24,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:24,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499472413] [2025-04-13 23:24:24,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499472413] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:24,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:24,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:24,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921686181] [2025-04-13 23:24:24,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:24,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:24,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:24,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:24,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:24,928 INFO L87 Difference]: Start difference. First operand 6570 states and 24081 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:25,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:25,778 INFO L93 Difference]: Finished difference Result 12559 states and 44662 transitions. [2025-04-13 23:24:25,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:25,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 23:24:25,779 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:25,824 INFO L225 Difference]: With dead ends: 12559 [2025-04-13 23:24:25,824 INFO L226 Difference]: Without dead ends: 12479 [2025-04-13 23:24:25,830 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:24:25,830 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 287 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:25,830 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 95 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:24:25,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12479 states. [2025-04-13 23:24:25,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12479 to 6560. [2025-04-13 23:24:25,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6560 states, 6559 states have (on average 3.666107638359506) internal successors, (24046), 6559 states have internal predecessors, (24046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:25,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6560 states to 6560 states and 24046 transitions. [2025-04-13 23:24:25,991 INFO L79 Accepts]: Start accepts. Automaton has 6560 states and 24046 transitions. Word has length 54 [2025-04-13 23:24:25,991 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:25,991 INFO L485 AbstractCegarLoop]: Abstraction has 6560 states and 24046 transitions. [2025-04-13 23:24:25,991 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:25,991 INFO L278 IsEmpty]: Start isEmpty. Operand 6560 states and 24046 transitions. [2025-04-13 23:24:26,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:26,002 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:26,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:26,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-04-13 23:24:26,003 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 23:24:26,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:26,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1882064911, now seen corresponding path program 62 times [2025-04-13 23:24:26,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:26,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399980104] [2025-04-13 23:24:26,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:24:26,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:26,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:26,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:26,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:24:26,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:26,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:26,624 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399980104] [2025-04-13 23:24:26,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399980104] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:26,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:26,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:26,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363642991] [2025-04-13 23:24:26,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:26,625 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:26,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:26,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:26,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:26,625 INFO L87 Difference]: Start difference. First operand 6560 states and 24046 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:27,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:27,568 INFO L93 Difference]: Finished difference Result 11361 states and 40273 transitions. [2025-04-13 23:24:27,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:27,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 23:24:27,569 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:27,612 INFO L225 Difference]: With dead ends: 11361 [2025-04-13 23:24:27,612 INFO L226 Difference]: Without dead ends: 11290 [2025-04-13 23:24:27,616 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:24:27,616 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 323 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:27,616 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 127 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1556 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:24:27,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11290 states. [2025-04-13 23:24:27,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11290 to 6571. [2025-04-13 23:24:27,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6571 states, 6570 states have (on average 3.6640791476407917) internal successors, (24073), 6570 states have internal predecessors, (24073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6571 states to 6571 states and 24073 transitions. [2025-04-13 23:24:27,808 INFO L79 Accepts]: Start accepts. Automaton has 6571 states and 24073 transitions. Word has length 54 [2025-04-13 23:24:27,808 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:27,808 INFO L485 AbstractCegarLoop]: Abstraction has 6571 states and 24073 transitions. [2025-04-13 23:24:27,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 23:24:27,808 INFO L278 IsEmpty]: Start isEmpty. Operand 6571 states and 24073 transitions. [2025-04-13 23:24:27,819 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:27,819 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:27,819 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:27,819 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-04-13 23:24:27,819 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 23:24:27,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:27,820 INFO L85 PathProgramCache]: Analyzing trace with hash -204415905, now seen corresponding path program 63 times [2025-04-13 23:24:27,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:27,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214682124] [2025-04-13 23:24:27,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:24:27,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:27,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:27,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:27,834 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:24:27,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:28,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:28,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:28,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214682124] [2025-04-13 23:24:28,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214682124] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:28,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:28,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:28,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976718062] [2025-04-13 23:24:28,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:28,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:28,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:28,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:28,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:28,446 INFO L87 Difference]: Start difference. First operand 6571 states and 24073 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:29,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:29,256 INFO L93 Difference]: Finished difference Result 12534 states and 44606 transitions. [2025-04-13 23:24:29,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:29,257 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:24:29,257 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:29,304 INFO L225 Difference]: With dead ends: 12534 [2025-04-13 23:24:29,304 INFO L226 Difference]: Without dead ends: 12390 [2025-04-13 23:24:29,309 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:24:29,309 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 307 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:29,309 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 75 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:24:29,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12390 states. [2025-04-13 23:24:29,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12390 to 6541. [2025-04-13 23:24:29,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6541 states, 6540 states have (on average 3.666360856269113) internal successors, (23978), 6540 states have internal predecessors, (23978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6541 states to 6541 states and 23978 transitions. [2025-04-13 23:24:29,468 INFO L79 Accepts]: Start accepts. Automaton has 6541 states and 23978 transitions. Word has length 54 [2025-04-13 23:24:29,469 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:29,469 INFO L485 AbstractCegarLoop]: Abstraction has 6541 states and 23978 transitions. [2025-04-13 23:24:29,469 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:29,469 INFO L278 IsEmpty]: Start isEmpty. Operand 6541 states and 23978 transitions. [2025-04-13 23:24:29,479 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:29,479 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:29,480 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:29,480 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-04-13 23:24:29,480 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 23:24:29,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:29,480 INFO L85 PathProgramCache]: Analyzing trace with hash 941929585, now seen corresponding path program 64 times [2025-04-13 23:24:29,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:29,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237297883] [2025-04-13 23:24:29,480 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:24:29,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:29,483 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:24:29,494 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 23:24:29,494 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:24:29,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:30,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 23:24:30,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:30,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237297883] [2025-04-13 23:24:30,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237297883] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:30,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:30,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:30,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998908884] [2025-04-13 23:24:30,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:30,144 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:30,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:30,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:30,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:30,144 INFO L87 Difference]: Start difference. First operand 6541 states and 23978 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:31,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:31,167 INFO L93 Difference]: Finished difference Result 11260 states and 39987 transitions. [2025-04-13 23:24:31,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:31,167 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:24:31,167 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:31,210 INFO L225 Difference]: With dead ends: 11260 [2025-04-13 23:24:31,210 INFO L226 Difference]: Without dead ends: 11147 [2025-04-13 23:24:31,215 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:24:31,215 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 280 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 1768 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:31,215 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 146 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1768 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:24:31,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11147 states. [2025-04-13 23:24:31,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11147 to 6498. [2025-04-13 23:24:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6498 states, 6497 states have (on average 3.672772048637833) internal successors, (23862), 6497 states have internal predecessors, (23862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6498 states to 6498 states and 23862 transitions. [2025-04-13 23:24:31,373 INFO L79 Accepts]: Start accepts. Automaton has 6498 states and 23862 transitions. Word has length 54 [2025-04-13 23:24:31,374 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:31,374 INFO L485 AbstractCegarLoop]: Abstraction has 6498 states and 23862 transitions. [2025-04-13 23:24:31,374 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:31,374 INFO L278 IsEmpty]: Start isEmpty. Operand 6498 states and 23862 transitions. [2025-04-13 23:24:31,385 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:31,385 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:31,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:31,385 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-04-13 23:24:31,385 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 23:24:31,386 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:31,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1487282911, now seen corresponding path program 65 times [2025-04-13 23:24:31,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:31,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769298409] [2025-04-13 23:24:31,386 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:24:31,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:31,389 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:31,400 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:31,400 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:24:31,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:32,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:32,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:32,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769298409] [2025-04-13 23:24:32,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769298409] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:32,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:32,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:32,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259071759] [2025-04-13 23:24:32,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:32,025 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:32,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:32,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:32,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:32,025 INFO L87 Difference]: Start difference. First operand 6498 states and 23862 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:33,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:33,000 INFO L93 Difference]: Finished difference Result 12488 states and 44445 transitions. [2025-04-13 23:24:33,001 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:33,001 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:24:33,001 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:33,048 INFO L225 Difference]: With dead ends: 12488 [2025-04-13 23:24:33,048 INFO L226 Difference]: Without dead ends: 12371 [2025-04-13 23:24:33,053 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:24:33,054 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 263 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:33,054 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 118 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:24:33,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12371 states. [2025-04-13 23:24:33,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12371 to 6597. [2025-04-13 23:24:33,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6597 states, 6596 states have (on average 3.6628259551243176) internal successors, (24160), 6596 states have internal predecessors, (24160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6597 states to 6597 states and 24160 transitions. [2025-04-13 23:24:33,217 INFO L79 Accepts]: Start accepts. Automaton has 6597 states and 24160 transitions. Word has length 54 [2025-04-13 23:24:33,218 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:33,218 INFO L485 AbstractCegarLoop]: Abstraction has 6597 states and 24160 transitions. [2025-04-13 23:24:33,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 23:24:33,218 INFO L278 IsEmpty]: Start isEmpty. Operand 6597 states and 24160 transitions. [2025-04-13 23:24:33,229 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:33,229 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:33,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:33,229 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-04-13 23:24:33,229 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 23:24:33,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:33,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2126289773, now seen corresponding path program 66 times [2025-04-13 23:24:33,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:33,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653830440] [2025-04-13 23:24:33,230 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:24:33,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:33,233 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:33,243 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:33,243 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:24:33,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:33,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:33,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:33,778 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653830440] [2025-04-13 23:24:33,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653830440] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:33,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:33,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:33,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412899315] [2025-04-13 23:24:33,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:33,779 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:33,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:33,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:33,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:33,779 INFO L87 Difference]: Start difference. First operand 6597 states and 24160 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:34,935 INFO L93 Difference]: Finished difference Result 11426 states and 40477 transitions. [2025-04-13 23:24:34,935 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:34,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 23:24:34,935 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:34,975 INFO L225 Difference]: With dead ends: 11426 [2025-04-13 23:24:34,976 INFO L226 Difference]: Without dead ends: 11358 [2025-04-13 23:24:34,979 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:24:34,979 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 287 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 1925 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:34,979 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 163 Invalid, 1941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1925 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:24:34,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11358 states. [2025-04-13 23:24:35,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11358 to 6622. [2025-04-13 23:24:35,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6622 states, 6621 states have (on average 3.661833559885214) internal successors, (24245), 6621 states have internal predecessors, (24245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:35,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6622 states to 6622 states and 24245 transitions. [2025-04-13 23:24:35,143 INFO L79 Accepts]: Start accepts. Automaton has 6622 states and 24245 transitions. Word has length 54 [2025-04-13 23:24:35,144 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:35,144 INFO L485 AbstractCegarLoop]: Abstraction has 6622 states and 24245 transitions. [2025-04-13 23:24:35,144 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:35,144 INFO L278 IsEmpty]: Start isEmpty. Operand 6622 states and 24245 transitions. [2025-04-13 23:24:35,156 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:35,156 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:35,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:35,156 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-04-13 23:24:35,156 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 23:24:35,156 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:35,156 INFO L85 PathProgramCache]: Analyzing trace with hash 52215421, now seen corresponding path program 67 times [2025-04-13 23:24:35,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:35,156 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145116647] [2025-04-13 23:24:35,156 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:24:35,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:35,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:35,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:35,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:24:35,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:35,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:35,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:35,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145116647] [2025-04-13 23:24:35,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145116647] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:35,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:35,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:35,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804553823] [2025-04-13 23:24:35,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:35,775 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:35,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:35,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:35,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:35,775 INFO L87 Difference]: Start difference. First operand 6622 states and 24245 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:36,682 INFO L93 Difference]: Finished difference Result 12548 states and 44590 transitions. [2025-04-13 23:24:36,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:36,682 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:24:36,682 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:36,732 INFO L225 Difference]: With dead ends: 12548 [2025-04-13 23:24:36,732 INFO L226 Difference]: Without dead ends: 12477 [2025-04-13 23:24:36,737 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:24:36,737 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 275 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:36,737 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 104 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:24:36,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12477 states. [2025-04-13 23:24:36,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12477 to 6633. [2025-04-13 23:24:36,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6633 states, 6632 states have (on average 3.6598311218335344) internal successors, (24272), 6632 states have internal predecessors, (24272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:36,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6633 states to 6633 states and 24272 transitions. [2025-04-13 23:24:36,908 INFO L79 Accepts]: Start accepts. Automaton has 6633 states and 24272 transitions. Word has length 54 [2025-04-13 23:24:36,908 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:36,909 INFO L485 AbstractCegarLoop]: Abstraction has 6633 states and 24272 transitions. [2025-04-13 23:24:36,909 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:36,909 INFO L278 IsEmpty]: Start isEmpty. Operand 6633 states and 24272 transitions. [2025-04-13 23:24:36,922 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:36,922 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:36,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 23:24:36,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-04-13 23:24:36,922 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 23:24:36,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:36,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1326285197, now seen corresponding path program 68 times [2025-04-13 23:24:36,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:36,922 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717765852] [2025-04-13 23:24:36,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:24:36,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:36,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:36,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:36,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:24:36,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:37,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:37,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717765852] [2025-04-13 23:24:37,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717765852] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:37,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:37,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:37,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116767108] [2025-04-13 23:24:37,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:37,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:37,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:37,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:37,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:37,531 INFO L87 Difference]: Start difference. First operand 6633 states and 24272 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:38,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:38,539 INFO L93 Difference]: Finished difference Result 11440 states and 40501 transitions. [2025-04-13 23:24:38,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:38,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 23:24:38,540 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:38,583 INFO L225 Difference]: With dead ends: 11440 [2025-04-13 23:24:38,584 INFO L226 Difference]: Without dead ends: 11359 [2025-04-13 23:24:38,588 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:24:38,589 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 335 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:38,589 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 127 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:24:38,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11359 states. [2025-04-13 23:24:38,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11359 to 6623. [2025-04-13 23:24:38,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6623 states, 6622 states have (on average 3.6608275445484746) internal successors, (24242), 6622 states have internal predecessors, (24242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:38,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6623 states to 6623 states and 24242 transitions. [2025-04-13 23:24:38,754 INFO L79 Accepts]: Start accepts. Automaton has 6623 states and 24242 transitions. Word has length 54 [2025-04-13 23:24:38,754 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:38,754 INFO L485 AbstractCegarLoop]: Abstraction has 6623 states and 24242 transitions. [2025-04-13 23:24:38,754 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:38,754 INFO L278 IsEmpty]: Start isEmpty. Operand 6623 states and 24242 transitions. [2025-04-13 23:24:38,765 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:38,765 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:38,766 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:38,766 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-04-13 23:24:38,766 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 23:24:38,766 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:38,766 INFO L85 PathProgramCache]: Analyzing trace with hash -887919905, now seen corresponding path program 69 times [2025-04-13 23:24:38,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:38,766 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533505748] [2025-04-13 23:24:38,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:24:38,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:38,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:38,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:38,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:24:38,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:39,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:39,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:39,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533505748] [2025-04-13 23:24:39,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533505748] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:39,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:39,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:39,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781367899] [2025-04-13 23:24:39,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:39,397 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:39,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:39,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:39,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:39,397 INFO L87 Difference]: Start difference. First operand 6623 states and 24242 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:40,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:40,336 INFO L93 Difference]: Finished difference Result 12467 states and 44369 transitions. [2025-04-13 23:24:40,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:40,336 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:24:40,336 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:40,381 INFO L225 Difference]: With dead ends: 12467 [2025-04-13 23:24:40,381 INFO L226 Difference]: Without dead ends: 12364 [2025-04-13 23:24:40,385 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 23:24:40,386 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 275 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 1601 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:40,386 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 114 Invalid, 1626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1601 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:24:40,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12364 states. [2025-04-13 23:24:40,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12364 to 6590. [2025-04-13 23:24:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6590 states, 6589 states have (on average 3.6635301259675215) internal successors, (24139), 6589 states have internal predecessors, (24139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:40,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6590 states to 6590 states and 24139 transitions. [2025-04-13 23:24:40,540 INFO L79 Accepts]: Start accepts. Automaton has 6590 states and 24139 transitions. Word has length 54 [2025-04-13 23:24:40,540 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:40,540 INFO L485 AbstractCegarLoop]: Abstraction has 6590 states and 24139 transitions. [2025-04-13 23:24:40,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 23:24:40,541 INFO L278 IsEmpty]: Start isEmpty. Operand 6590 states and 24139 transitions. [2025-04-13 23:24:40,551 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:40,551 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:40,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:40,551 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-04-13 23:24:40,551 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 23:24:40,552 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:40,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1248101557, now seen corresponding path program 70 times [2025-04-13 23:24:40,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:40,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859160815] [2025-04-13 23:24:40,552 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:24:40,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:40,555 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:24:40,566 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 23:24:40,566 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:24:40,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:41,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 23:24:41,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:41,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859160815] [2025-04-13 23:24:41,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859160815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:41,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:41,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:41,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917364909] [2025-04-13 23:24:41,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:41,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:41,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:41,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:41,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:41,130 INFO L87 Difference]: Start difference. First operand 6590 states and 24139 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:42,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:42,150 INFO L93 Difference]: Finished difference Result 11474 states and 40574 transitions. [2025-04-13 23:24:42,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:24:42,150 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:24:42,151 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:42,189 INFO L225 Difference]: With dead ends: 11474 [2025-04-13 23:24:42,189 INFO L226 Difference]: Without dead ends: 11406 [2025-04-13 23:24:42,193 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:24:42,193 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 355 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 1625 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:42,193 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 135 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1625 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:24:42,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11406 states. [2025-04-13 23:24:42,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11406 to 6600. [2025-04-13 23:24:42,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6600 states, 6599 states have (on average 3.6617669343839974) internal successors, (24164), 6599 states have internal predecessors, (24164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6600 states to 6600 states and 24164 transitions. [2025-04-13 23:24:42,338 INFO L79 Accepts]: Start accepts. Automaton has 6600 states and 24164 transitions. Word has length 54 [2025-04-13 23:24:42,338 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:42,338 INFO L485 AbstractCegarLoop]: Abstraction has 6600 states and 24164 transitions. [2025-04-13 23:24:42,338 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:42,339 INFO L278 IsEmpty]: Start isEmpty. Operand 6600 states and 24164 transitions. [2025-04-13 23:24:42,349 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:42,349 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:42,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:42,349 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-04-13 23:24:42,349 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 23:24:42,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:42,350 INFO L85 PathProgramCache]: Analyzing trace with hash 133614477, now seen corresponding path program 71 times [2025-04-13 23:24:42,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:42,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633085438] [2025-04-13 23:24:42,350 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:24:42,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:42,353 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:42,364 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:42,364 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:24:42,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:42,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:42,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:42,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633085438] [2025-04-13 23:24:42,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633085438] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:42,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:42,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:42,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043357065] [2025-04-13 23:24:42,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:42,932 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:42,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:42,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:42,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:42,932 INFO L87 Difference]: Start difference. First operand 6600 states and 24164 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:43,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:43,814 INFO L93 Difference]: Finished difference Result 12466 states and 44356 transitions. [2025-04-13 23:24:43,815 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:43,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 23:24:43,815 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:43,861 INFO L225 Difference]: With dead ends: 12466 [2025-04-13 23:24:43,861 INFO L226 Difference]: Without dead ends: 12395 [2025-04-13 23:24:43,865 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:24:43,865 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 278 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:43,865 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 104 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:24:43,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12395 states. [2025-04-13 23:24:43,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12395 to 6633. [2025-04-13 23:24:43,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6633 states, 6632 states have (on average 3.659077201447527) internal successors, (24267), 6632 states have internal predecessors, (24267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:44,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6633 states to 6633 states and 24267 transitions. [2025-04-13 23:24:44,077 INFO L79 Accepts]: Start accepts. Automaton has 6633 states and 24267 transitions. Word has length 54 [2025-04-13 23:24:44,077 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:44,078 INFO L485 AbstractCegarLoop]: Abstraction has 6633 states and 24267 transitions. [2025-04-13 23:24:44,078 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:44,078 INFO L278 IsEmpty]: Start isEmpty. Operand 6633 states and 24267 transitions. [2025-04-13 23:24:44,088 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:44,088 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:44,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:44,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-04-13 23:24:44,088 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 23:24:44,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:44,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2018579539, now seen corresponding path program 72 times [2025-04-13 23:24:44,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:44,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455068545] [2025-04-13 23:24:44,089 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:24:44,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:44,092 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:44,102 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:44,102 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:24:44,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:44,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:44,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:44,633 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455068545] [2025-04-13 23:24:44,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455068545] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:44,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:44,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:44,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260691241] [2025-04-13 23:24:44,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:44,634 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:44,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:44,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:44,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:44,634 INFO L87 Difference]: Start difference. First operand 6633 states and 24267 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:45,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:45,846 INFO L93 Difference]: Finished difference Result 11461 states and 40559 transitions. [2025-04-13 23:24:45,846 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:45,846 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:24:45,846 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:45,889 INFO L225 Difference]: With dead ends: 11461 [2025-04-13 23:24:45,889 INFO L226 Difference]: Without dead ends: 11381 [2025-04-13 23:24:45,893 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:24:45,893 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 325 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 1865 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:45,893 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 156 Invalid, 1882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1865 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:24:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11381 states. [2025-04-13 23:24:46,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11381 to 6623. [2025-04-13 23:24:46,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6623 states, 6622 states have (on average 3.660072485653881) internal successors, (24237), 6622 states have internal predecessors, (24237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:46,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6623 states to 6623 states and 24237 transitions. [2025-04-13 23:24:46,047 INFO L79 Accepts]: Start accepts. Automaton has 6623 states and 24237 transitions. Word has length 54 [2025-04-13 23:24:46,047 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:46,047 INFO L485 AbstractCegarLoop]: Abstraction has 6623 states and 24237 transitions. [2025-04-13 23:24:46,047 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:46,048 INFO L278 IsEmpty]: Start isEmpty. Operand 6623 states and 24237 transitions. [2025-04-13 23:24:46,059 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:46,059 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:46,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:46,059 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-04-13 23:24:46,059 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 23:24:46,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:46,059 INFO L85 PathProgramCache]: Analyzing trace with hash -806520849, now seen corresponding path program 73 times [2025-04-13 23:24:46,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:46,060 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686755955] [2025-04-13 23:24:46,060 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:24:46,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:46,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:46,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:46,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:24:46,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:46,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 23:24:46,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:46,702 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686755955] [2025-04-13 23:24:46,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686755955] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:46,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:46,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:46,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245395795] [2025-04-13 23:24:46,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:46,702 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:46,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:46,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:46,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:46,703 INFO L87 Difference]: Start difference. First operand 6623 states and 24237 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:47,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:47,547 INFO L93 Difference]: Finished difference Result 12455 states and 44313 transitions. [2025-04-13 23:24:47,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:47,548 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:24:47,548 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:47,594 INFO L225 Difference]: With dead ends: 12455 [2025-04-13 23:24:47,594 INFO L226 Difference]: Without dead ends: 12374 [2025-04-13 23:24:47,599 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:24:47,599 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 272 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:47,599 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 92 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:24:47,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12374 states. [2025-04-13 23:24:47,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12374 to 6612. [2025-04-13 23:24:47,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6612 states, 6611 states have (on average 3.6604144607472393) internal successors, (24199), 6611 states have internal predecessors, (24199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6612 states to 6612 states and 24199 transitions. [2025-04-13 23:24:47,763 INFO L79 Accepts]: Start accepts. Automaton has 6612 states and 24199 transitions. Word has length 54 [2025-04-13 23:24:47,763 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:47,763 INFO L485 AbstractCegarLoop]: Abstraction has 6612 states and 24199 transitions. [2025-04-13 23:24:47,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:47,763 INFO L278 IsEmpty]: Start isEmpty. Operand 6612 states and 24199 transitions. [2025-04-13 23:24:47,774 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:47,775 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:47,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:47,775 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-04-13 23:24:47,775 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 23:24:47,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:47,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1083695765, now seen corresponding path program 74 times [2025-04-13 23:24:47,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:47,775 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039096266] [2025-04-13 23:24:47,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:24:47,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:47,779 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:47,788 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:47,788 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:24:47,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:48,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 23:24:48,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:48,400 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039096266] [2025-04-13 23:24:48,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039096266] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:48,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:48,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:48,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803071920] [2025-04-13 23:24:48,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:48,401 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:48,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:48,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:48,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:48,401 INFO L87 Difference]: Start difference. First operand 6612 states and 24199 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:49,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:49,319 INFO L93 Difference]: Finished difference Result 11500 states and 40644 transitions. [2025-04-13 23:24:49,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:49,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 23:24:49,320 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:49,363 INFO L225 Difference]: With dead ends: 11500 [2025-04-13 23:24:49,364 INFO L226 Difference]: Without dead ends: 11429 [2025-04-13 23:24:49,368 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 23:24:49,368 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 354 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:49,368 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 107 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:24:49,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11429 states. [2025-04-13 23:24:49,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11429 to 6623. [2025-04-13 23:24:49,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6623 states, 6622 states have (on average 3.6584113560857747) internal successors, (24226), 6622 states have internal predecessors, (24226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:49,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6623 states to 6623 states and 24226 transitions. [2025-04-13 23:24:49,525 INFO L79 Accepts]: Start accepts. Automaton has 6623 states and 24226 transitions. Word has length 54 [2025-04-13 23:24:49,525 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:49,526 INFO L485 AbstractCegarLoop]: Abstraction has 6623 states and 24226 transitions. [2025-04-13 23:24:49,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 23:24:49,526 INFO L278 IsEmpty]: Start isEmpty. Operand 6623 states and 24226 transitions. [2025-04-13 23:24:49,537 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:49,537 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:49,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:49,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-04-13 23:24:49,537 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 23:24:49,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:49,537 INFO L85 PathProgramCache]: Analyzing trace with hash 807045885, now seen corresponding path program 75 times [2025-04-13 23:24:49,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:49,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629785413] [2025-04-13 23:24:49,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:24:49,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:49,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:49,552 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:49,552 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:24:49,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:50,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:50,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:50,147 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629785413] [2025-04-13 23:24:50,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629785413] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:50,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:50,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:50,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900109185] [2025-04-13 23:24:50,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:50,147 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:50,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:50,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:50,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:50,148 INFO L87 Difference]: Start difference. First operand 6623 states and 24226 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:51,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:51,058 INFO L93 Difference]: Finished difference Result 12385 states and 44124 transitions. [2025-04-13 23:24:51,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:51,059 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:24:51,059 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:51,105 INFO L225 Difference]: With dead ends: 12385 [2025-04-13 23:24:51,106 INFO L226 Difference]: Without dead ends: 12107 [2025-04-13 23:24:51,111 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 23:24:51,111 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 269 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:51,111 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 105 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:24:51,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12107 states. [2025-04-13 23:24:51,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12107 to 6459. [2025-04-13 23:24:51,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6459 states, 6458 states have (on average 3.673583152678848) internal successors, (23724), 6458 states have internal predecessors, (23724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6459 states to 6459 states and 23724 transitions. [2025-04-13 23:24:51,310 INFO L79 Accepts]: Start accepts. Automaton has 6459 states and 23724 transitions. Word has length 54 [2025-04-13 23:24:51,311 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:51,311 INFO L485 AbstractCegarLoop]: Abstraction has 6459 states and 23724 transitions. [2025-04-13 23:24:51,311 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:51,311 INFO L278 IsEmpty]: Start isEmpty. Operand 6459 states and 23724 transitions. [2025-04-13 23:24:51,322 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:51,323 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:51,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:51,323 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-04-13 23:24:51,323 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 23:24:51,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:51,324 INFO L85 PathProgramCache]: Analyzing trace with hash -2023831091, now seen corresponding path program 76 times [2025-04-13 23:24:51,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:51,324 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962567374] [2025-04-13 23:24:51,324 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:24:51,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:51,327 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:24:51,338 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 23:24:51,338 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:24:51,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:51,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:51,940 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962567374] [2025-04-13 23:24:51,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962567374] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:51,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:51,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:51,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494706980] [2025-04-13 23:24:51,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:51,941 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:51,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:51,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:51,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:51,941 INFO L87 Difference]: Start difference. First operand 6459 states and 23724 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:52,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:52,857 INFO L93 Difference]: Finished difference Result 11287 states and 40016 transitions. [2025-04-13 23:24:52,857 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:52,857 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:24:52,857 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:52,903 INFO L225 Difference]: With dead ends: 11287 [2025-04-13 23:24:52,903 INFO L226 Difference]: Without dead ends: 11201 [2025-04-13 23:24:52,908 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:24:52,908 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 328 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:52,908 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 124 Invalid, 1527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:24:52,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11201 states. [2025-04-13 23:24:53,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11201 to 6443. [2025-04-13 23:24:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6443 states, 6442 states have (on average 3.676187519403912) internal successors, (23682), 6442 states have internal predecessors, (23682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:53,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6443 states to 6443 states and 23682 transitions. [2025-04-13 23:24:53,068 INFO L79 Accepts]: Start accepts. Automaton has 6443 states and 23682 transitions. Word has length 54 [2025-04-13 23:24:53,069 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:53,069 INFO L485 AbstractCegarLoop]: Abstraction has 6443 states and 23682 transitions. [2025-04-13 23:24:53,069 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:53,069 INFO L278 IsEmpty]: Start isEmpty. Operand 6443 states and 23682 transitions. [2025-04-13 23:24:53,080 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:53,080 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:53,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:53,080 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-04-13 23:24:53,080 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 23:24:53,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:53,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728487, now seen corresponding path program 77 times [2025-04-13 23:24:53,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:53,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26847983] [2025-04-13 23:24:53,080 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:24:53,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:53,084 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:53,095 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:53,095 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:24:53,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:53,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:53,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:53,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26847983] [2025-04-13 23:24:53,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26847983] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:53,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:53,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:53,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275443451] [2025-04-13 23:24:53,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:53,742 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:53,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:53,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:53,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:53,743 INFO L87 Difference]: Start difference. First operand 6443 states and 23682 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:54,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:54,715 INFO L93 Difference]: Finished difference Result 12640 states and 45001 transitions. [2025-04-13 23:24:54,715 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:54,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 23:24:54,715 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:54,759 INFO L225 Difference]: With dead ends: 12640 [2025-04-13 23:24:54,759 INFO L226 Difference]: Without dead ends: 12569 [2025-04-13 23:24:54,764 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 23:24:54,765 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 280 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:54,765 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 119 Invalid, 1669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:24:54,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12569 states. [2025-04-13 23:24:54,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12569 to 6603. [2025-04-13 23:24:54,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6603 states, 6602 states have (on average 3.674189639503181) internal successors, (24257), 6602 states have internal predecessors, (24257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6603 states to 6603 states and 24257 transitions. [2025-04-13 23:24:54,943 INFO L79 Accepts]: Start accepts. Automaton has 6603 states and 24257 transitions. Word has length 54 [2025-04-13 23:24:54,943 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:54,943 INFO L485 AbstractCegarLoop]: Abstraction has 6603 states and 24257 transitions. [2025-04-13 23:24:54,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 23:24:54,943 INFO L278 IsEmpty]: Start isEmpty. Operand 6603 states and 24257 transitions. [2025-04-13 23:24:54,954 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:54,954 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:54,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:54,954 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-04-13 23:24:54,955 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 23:24:54,955 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:54,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1527826941, now seen corresponding path program 78 times [2025-04-13 23:24:54,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:54,955 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851251960] [2025-04-13 23:24:54,955 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:24:54,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:54,958 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:54,967 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:54,967 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:24:54,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:55,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 23:24:55,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:55,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851251960] [2025-04-13 23:24:55,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851251960] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:55,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:55,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:55,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506191621] [2025-04-13 23:24:55,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:55,589 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:55,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:55,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:55,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:55,590 INFO L87 Difference]: Start difference. First operand 6603 states and 24257 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:56,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:56,675 INFO L93 Difference]: Finished difference Result 11305 states and 40201 transitions. [2025-04-13 23:24:56,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:24:56,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 23:24:56,676 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:56,719 INFO L225 Difference]: With dead ends: 11305 [2025-04-13 23:24:56,719 INFO L226 Difference]: Without dead ends: 11237 [2025-04-13 23:24:56,723 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:24:56,723 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 297 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:56,723 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 133 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:24:56,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11237 states. [2025-04-13 23:24:56,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11237 to 6633. [2025-04-13 23:24:56,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6633 states, 6632 states have (on average 3.6718938480096504) internal successors, (24352), 6632 states have internal predecessors, (24352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:56,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6633 states to 6633 states and 24352 transitions. [2025-04-13 23:24:56,869 INFO L79 Accepts]: Start accepts. Automaton has 6633 states and 24352 transitions. Word has length 54 [2025-04-13 23:24:56,869 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:56,869 INFO L485 AbstractCegarLoop]: Abstraction has 6633 states and 24352 transitions. [2025-04-13 23:24:56,869 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:56,869 INFO L278 IsEmpty]: Start isEmpty. Operand 6633 states and 24352 transitions. [2025-04-13 23:24:56,879 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:56,879 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:56,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:56,880 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2025-04-13 23:24:56,880 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 23:24:56,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:56,880 INFO L85 PathProgramCache]: Analyzing trace with hash -969723911, now seen corresponding path program 79 times [2025-04-13 23:24:56,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:56,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243362819] [2025-04-13 23:24:56,880 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:24:56,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:56,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:56,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:56,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:24:56,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:57,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 23:24:57,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:57,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243362819] [2025-04-13 23:24:57,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243362819] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:57,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:57,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:57,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799389] [2025-04-13 23:24:57,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:57,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:57,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:57,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:57,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:57,541 INFO L87 Difference]: Start difference. First operand 6633 states and 24352 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:58,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:58,511 INFO L93 Difference]: Finished difference Result 12599 states and 44906 transitions. [2025-04-13 23:24:58,512 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:24:58,512 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:24:58,512 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:58,557 INFO L225 Difference]: With dead ends: 12599 [2025-04-13 23:24:58,558 INFO L226 Difference]: Without dead ends: 12521 [2025-04-13 23:24:58,562 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 23:24:58,562 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 284 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:58,562 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 113 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:24:58,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12521 states. [2025-04-13 23:24:58,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12521 to 6623. [2025-04-13 23:24:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6623 states, 6622 states have (on average 3.6721534279673813) internal successors, (24317), 6622 states have internal predecessors, (24317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:58,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6623 states to 6623 states and 24317 transitions. [2025-04-13 23:24:58,725 INFO L79 Accepts]: Start accepts. Automaton has 6623 states and 24317 transitions. Word has length 54 [2025-04-13 23:24:58,725 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:58,725 INFO L485 AbstractCegarLoop]: Abstraction has 6623 states and 24317 transitions. [2025-04-13 23:24:58,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 23:24:58,726 INFO L278 IsEmpty]: Start isEmpty. Operand 6623 states and 24317 transitions. [2025-04-13 23:24:58,736 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:24:58,737 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:58,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:24:58,737 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-04-13 23:24:58,737 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 23:24:58,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:58,737 INFO L85 PathProgramCache]: Analyzing trace with hash 757348959, now seen corresponding path program 80 times [2025-04-13 23:24:58,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:58,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700569222] [2025-04-13 23:24:58,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:24:58,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:58,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:24:58,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:24:58,750 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:24:58,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:24:59,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:59,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700569222] [2025-04-13 23:24:59,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700569222] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:24:59,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:24:59,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:24:59,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343603751] [2025-04-13 23:24:59,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:24:59,298 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:24:59,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:24:59,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:24:59,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:24:59,299 INFO L87 Difference]: Start difference. First operand 6623 states and 24317 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:00,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:00,488 INFO L93 Difference]: Finished difference Result 11297 states and 40161 transitions. [2025-04-13 23:25:00,488 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:00,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 23:25:00,488 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:00,525 INFO L225 Difference]: With dead ends: 11297 [2025-04-13 23:25:00,525 INFO L226 Difference]: Without dead ends: 11217 [2025-04-13 23:25:00,527 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:25:00,527 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 306 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 1878 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:00,527 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 156 Invalid, 1894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1878 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:25:00,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11217 states. [2025-04-13 23:25:00,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11217 to 6613. [2025-04-13 23:25:00,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6613 states, 6612 states have (on average 3.6724137931034484) internal successors, (24282), 6612 states have internal predecessors, (24282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:00,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6613 states to 6613 states and 24282 transitions. [2025-04-13 23:25:00,692 INFO L79 Accepts]: Start accepts. Automaton has 6613 states and 24282 transitions. Word has length 54 [2025-04-13 23:25:00,692 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:00,692 INFO L485 AbstractCegarLoop]: Abstraction has 6613 states and 24282 transitions. [2025-04-13 23:25:00,692 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:00,692 INFO L278 IsEmpty]: Start isEmpty. Operand 6613 states and 24282 transitions. [2025-04-13 23:25:00,704 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:00,704 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:00,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 23:25:00,704 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2025-04-13 23:25:00,704 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 23:25:00,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:00,704 INFO L85 PathProgramCache]: Analyzing trace with hash -55364069, now seen corresponding path program 81 times [2025-04-13 23:25:00,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:00,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618266406] [2025-04-13 23:25:00,705 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:25:00,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:00,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:00,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:00,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:25:00,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:01,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:01,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618266406] [2025-04-13 23:25:01,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618266406] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:01,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:01,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:01,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713276163] [2025-04-13 23:25:01,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:01,333 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:01,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:01,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:01,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:01,334 INFO L87 Difference]: Start difference. First operand 6613 states and 24282 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:02,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:02,296 INFO L93 Difference]: Finished difference Result 12511 states and 44663 transitions. [2025-04-13 23:25:02,296 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:02,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 23:25:02,296 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:02,344 INFO L225 Difference]: With dead ends: 12511 [2025-04-13 23:25:02,344 INFO L226 Difference]: Without dead ends: 12374 [2025-04-13 23:25:02,349 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 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 23:25:02,349 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 257 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:02,350 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 114 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:25:02,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12374 states. [2025-04-13 23:25:02,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12374 to 6593. [2025-04-13 23:25:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6593 states, 6592 states have (on average 3.6714199029126213) internal successors, (24202), 6592 states have internal predecessors, (24202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6593 states to 6593 states and 24202 transitions. [2025-04-13 23:25:02,513 INFO L79 Accepts]: Start accepts. Automaton has 6593 states and 24202 transitions. Word has length 54 [2025-04-13 23:25:02,514 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:02,514 INFO L485 AbstractCegarLoop]: Abstraction has 6593 states and 24202 transitions. [2025-04-13 23:25:02,514 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:02,514 INFO L278 IsEmpty]: Start isEmpty. Operand 6593 states and 24202 transitions. [2025-04-13 23:25:02,527 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:02,528 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:02,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 23:25:02,528 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2025-04-13 23:25:02,528 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 23:25:02,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:02,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1929303155, now seen corresponding path program 82 times [2025-04-13 23:25:02,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:02,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571844820] [2025-04-13 23:25:02,528 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:25:02,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:02,532 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:25:02,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 23:25:02,542 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:25:02,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:03,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 23:25:03,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:03,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571844820] [2025-04-13 23:25:03,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571844820] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:03,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:03,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:03,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834205909] [2025-04-13 23:25:03,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:03,127 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:03,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:03,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:03,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:03,128 INFO L87 Difference]: Start difference. First operand 6593 states and 24202 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:04,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:04,140 INFO L93 Difference]: Finished difference Result 11241 states and 39998 transitions. [2025-04-13 23:25:04,140 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:04,140 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:25:04,140 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:04,180 INFO L225 Difference]: With dead ends: 11241 [2025-04-13 23:25:04,180 INFO L226 Difference]: Without dead ends: 11107 [2025-04-13 23:25:04,184 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:25:04,184 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 291 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1745 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:04,184 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 144 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1745 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:25:04,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11107 states. [2025-04-13 23:25:04,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11107 to 6573. [2025-04-13 23:25:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6573 states, 6572 states have (on average 3.6719415702982348) internal successors, (24132), 6572 states have internal predecessors, (24132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:04,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6573 states to 6573 states and 24132 transitions. [2025-04-13 23:25:04,329 INFO L79 Accepts]: Start accepts. Automaton has 6573 states and 24132 transitions. Word has length 54 [2025-04-13 23:25:04,329 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:04,329 INFO L485 AbstractCegarLoop]: Abstraction has 6573 states and 24132 transitions. [2025-04-13 23:25:04,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 23:25:04,330 INFO L278 IsEmpty]: Start isEmpty. Operand 6573 states and 24132 transitions. [2025-04-13 23:25:04,340 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:04,340 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:04,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:04,341 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2025-04-13 23:25:04,341 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 23:25:04,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:04,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1764476935, now seen corresponding path program 83 times [2025-04-13 23:25:04,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:04,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023555335] [2025-04-13 23:25:04,341 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:25:04,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:04,344 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:04,355 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:04,355 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:25:04,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:05,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:05,010 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023555335] [2025-04-13 23:25:05,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023555335] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:05,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:05,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:05,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445180358] [2025-04-13 23:25:05,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:05,011 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:05,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:05,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:05,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:05,011 INFO L87 Difference]: Start difference. First operand 6573 states and 24132 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:05,961 INFO L93 Difference]: Finished difference Result 12563 states and 44777 transitions. [2025-04-13 23:25:05,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:05,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 23:25:05,962 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:06,008 INFO L225 Difference]: With dead ends: 12563 [2025-04-13 23:25:06,008 INFO L226 Difference]: Without dead ends: 12492 [2025-04-13 23:25:06,013 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 23:25:06,013 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 264 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:06,013 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 121 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:25:06,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12492 states. [2025-04-13 23:25:06,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12492 to 6603. [2025-04-13 23:25:06,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6603 states, 6602 states have (on average 3.669645561950924) internal successors, (24227), 6602 states have internal predecessors, (24227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:06,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6603 states to 6603 states and 24227 transitions. [2025-04-13 23:25:06,191 INFO L79 Accepts]: Start accepts. Automaton has 6603 states and 24227 transitions. Word has length 54 [2025-04-13 23:25:06,191 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:06,191 INFO L485 AbstractCegarLoop]: Abstraction has 6603 states and 24227 transitions. [2025-04-13 23:25:06,191 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:06,191 INFO L278 IsEmpty]: Start isEmpty. Operand 6603 states and 24227 transitions. [2025-04-13 23:25:06,202 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:06,202 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:06,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 23:25:06,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2025-04-13 23:25:06,202 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 23:25:06,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:06,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1529434621, now seen corresponding path program 84 times [2025-04-13 23:25:06,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:06,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147172722] [2025-04-13 23:25:06,203 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:25:06,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:06,206 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:06,215 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:06,215 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:25:06,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:06,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:06,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147172722] [2025-04-13 23:25:06,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147172722] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:06,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:06,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:06,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285775635] [2025-04-13 23:25:06,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:06,886 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:06,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:06,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:06,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:06,886 INFO L87 Difference]: Start difference. First operand 6603 states and 24227 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:07,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:07,672 INFO L93 Difference]: Finished difference Result 11355 states and 40317 transitions. [2025-04-13 23:25:07,672 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:07,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 23:25:07,672 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:07,715 INFO L225 Difference]: With dead ends: 11355 [2025-04-13 23:25:07,715 INFO L226 Difference]: Without dead ends: 11284 [2025-04-13 23:25:07,719 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:25:07,720 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 324 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:07,721 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 99 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:25:07,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11284 states. [2025-04-13 23:25:07,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11284 to 6636. [2025-04-13 23:25:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6636 states, 6635 states have (on average 3.6669178598342125) internal successors, (24330), 6635 states have internal predecessors, (24330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:07,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6636 states to 6636 states and 24330 transitions. [2025-04-13 23:25:07,890 INFO L79 Accepts]: Start accepts. Automaton has 6636 states and 24330 transitions. Word has length 54 [2025-04-13 23:25:07,890 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:07,890 INFO L485 AbstractCegarLoop]: Abstraction has 6636 states and 24330 transitions. [2025-04-13 23:25:07,890 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:07,890 INFO L278 IsEmpty]: Start isEmpty. Operand 6636 states and 24330 transitions. [2025-04-13 23:25:07,902 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:07,902 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:07,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 23:25:07,902 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2025-04-13 23:25:07,902 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 23:25:07,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:07,902 INFO L85 PathProgramCache]: Analyzing trace with hash -964472359, now seen corresponding path program 85 times [2025-04-13 23:25:07,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:07,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302083488] [2025-04-13 23:25:07,903 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:25:07,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:07,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:07,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:07,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:25:07,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:08,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 23:25:08,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:08,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302083488] [2025-04-13 23:25:08,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302083488] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:08,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:08,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:08,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817913766] [2025-04-13 23:25:08,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:08,573 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:08,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:08,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:08,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:08,574 INFO L87 Difference]: Start difference. First operand 6636 states and 24330 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:09,582 INFO L93 Difference]: Finished difference Result 12593 states and 44863 transitions. [2025-04-13 23:25:09,582 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:25:09,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 23:25:09,582 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:09,626 INFO L225 Difference]: With dead ends: 12593 [2025-04-13 23:25:09,627 INFO L226 Difference]: Without dead ends: 12515 [2025-04-13 23:25:09,632 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:25:09,632 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 278 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:09,632 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 111 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:25:09,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12515 states. [2025-04-13 23:25:09,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12515 to 6626. [2025-04-13 23:25:09,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6626 states, 6625 states have (on average 3.667169811320755) internal successors, (24295), 6625 states have internal predecessors, (24295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:09,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6626 states to 6626 states and 24295 transitions. [2025-04-13 23:25:09,789 INFO L79 Accepts]: Start accepts. Automaton has 6626 states and 24295 transitions. Word has length 54 [2025-04-13 23:25:09,790 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:09,790 INFO L485 AbstractCegarLoop]: Abstraction has 6626 states and 24295 transitions. [2025-04-13 23:25:09,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 23:25:09,790 INFO L278 IsEmpty]: Start isEmpty. Operand 6626 states and 24295 transitions. [2025-04-13 23:25:09,800 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:09,801 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:09,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:09,801 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2025-04-13 23:25:09,801 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 23:25:09,801 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:09,801 INFO L85 PathProgramCache]: Analyzing trace with hash 589299295, now seen corresponding path program 86 times [2025-04-13 23:25:09,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:09,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744519486] [2025-04-13 23:25:09,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:25:09,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:09,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:09,813 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:09,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:25:09,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:10,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:10,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:10,421 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744519486] [2025-04-13 23:25:10,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744519486] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:10,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:10,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:10,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499463725] [2025-04-13 23:25:10,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:10,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:10,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:10,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:10,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:10,422 INFO L87 Difference]: Start difference. First operand 6626 states and 24295 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:11,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:11,378 INFO L93 Difference]: Finished difference Result 11344 states and 40269 transitions. [2025-04-13 23:25:11,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25: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 23:25:11,379 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:11,423 INFO L225 Difference]: With dead ends: 11344 [2025-04-13 23:25:11,423 INFO L226 Difference]: Without dead ends: 11263 [2025-04-13 23:25:11,427 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:25:11,428 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 292 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:11,428 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 135 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:25:11,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11263 states. [2025-04-13 23:25:11,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11263 to 6615. [2025-04-13 23:25:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6615 states, 6614 states have (on average 3.667523435137587) internal successors, (24257), 6614 states have internal predecessors, (24257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:11,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6615 states to 6615 states and 24257 transitions. [2025-04-13 23:25:11,614 INFO L79 Accepts]: Start accepts. Automaton has 6615 states and 24257 transitions. Word has length 54 [2025-04-13 23:25:11,614 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:11,615 INFO L485 AbstractCegarLoop]: Abstraction has 6615 states and 24257 transitions. [2025-04-13 23:25:11,615 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:11,615 INFO L278 IsEmpty]: Start isEmpty. Operand 6615 states and 24257 transitions. [2025-04-13 23:25:11,626 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:11,626 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:11,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:11,627 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2025-04-13 23:25:11,627 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 23:25:11,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:11,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1189431781, now seen corresponding path program 87 times [2025-04-13 23:25:11,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:11,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124872488] [2025-04-13 23:25:11,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:25:11,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:11,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:11,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:11,642 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:25:11,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:12,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 23:25:12,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:12,259 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124872488] [2025-04-13 23:25:12,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124872488] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:12,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:12,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:12,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638726827] [2025-04-13 23:25:12,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:12,259 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:12,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:12,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:12,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:12,260 INFO L87 Difference]: Start difference. First operand 6615 states and 24257 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:13,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:13,219 INFO L93 Difference]: Finished difference Result 12504 states and 44617 transitions. [2025-04-13 23:25:13,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:25:13,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 23:25:13,220 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:13,271 INFO L225 Difference]: With dead ends: 12504 [2025-04-13 23:25:13,271 INFO L226 Difference]: Without dead ends: 12336 [2025-04-13 23:25:13,276 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:25:13,277 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 247 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:13,277 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 107 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:25:13,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12336 states. [2025-04-13 23:25:13,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12336 to 6555. [2025-04-13 23:25:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6555 states, 6554 states have (on average 3.6705828501678366) internal successors, (24057), 6554 states have internal predecessors, (24057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:13,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6555 states to 6555 states and 24057 transitions. [2025-04-13 23:25:13,455 INFO L79 Accepts]: Start accepts. Automaton has 6555 states and 24057 transitions. Word has length 54 [2025-04-13 23:25:13,455 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:13,455 INFO L485 AbstractCegarLoop]: Abstraction has 6555 states and 24057 transitions. [2025-04-13 23:25:13,455 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:13,455 INFO L278 IsEmpty]: Start isEmpty. Operand 6555 states and 24057 transitions. [2025-04-13 23:25:13,466 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:13,467 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:13,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 23:25:13,467 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2025-04-13 23:25:13,467 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 23:25:13,467 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:13,467 INFO L85 PathProgramCache]: Analyzing trace with hash -2092101267, now seen corresponding path program 88 times [2025-04-13 23:25:13,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:13,467 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405606884] [2025-04-13 23:25:13,467 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:25:13,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:13,470 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:25:13,481 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 23:25:13,481 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:25:13,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:14,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:14,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:14,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405606884] [2025-04-13 23:25:14,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405606884] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:14,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:14,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:14,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045671274] [2025-04-13 23:25:14,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:14,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:14,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:14,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:14,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:14,165 INFO L87 Difference]: Start difference. First operand 6555 states and 24057 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:15,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:15,051 INFO L93 Difference]: Finished difference Result 11203 states and 39853 transitions. [2025-04-13 23:25:15,052 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:15,052 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:25:15,052 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:15,104 INFO L225 Difference]: With dead ends: 11203 [2025-04-13 23:25:15,104 INFO L226 Difference]: Without dead ends: 11057 [2025-04-13 23:25:15,109 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:25:15,109 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 260 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1535 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:15,109 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 126 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:25:15,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11057 states. [2025-04-13 23:25:15,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11057 to 6523. [2025-04-13 23:25:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6523 states, 6522 states have (on average 3.6732597362772155) internal successors, (23957), 6522 states have internal predecessors, (23957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:15,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6523 states to 6523 states and 23957 transitions. [2025-04-13 23:25:15,276 INFO L79 Accepts]: Start accepts. Automaton has 6523 states and 23957 transitions. Word has length 54 [2025-04-13 23:25:15,277 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:15,277 INFO L485 AbstractCegarLoop]: Abstraction has 6523 states and 23957 transitions. [2025-04-13 23:25:15,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 23:25:15,277 INFO L278 IsEmpty]: Start isEmpty. Operand 6523 states and 23957 transitions. [2025-04-13 23:25:15,289 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:15,289 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:15,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 23:25:15,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2025-04-13 23:25:15,289 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 23:25:15,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:15,289 INFO L85 PathProgramCache]: Analyzing trace with hash -299367911, now seen corresponding path program 89 times [2025-04-13 23:25:15,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:15,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130878335] [2025-04-13 23:25:15,289 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:25:15,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:15,292 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:15,304 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:15,304 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:25:15,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:15,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 23:25:15,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:15,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130878335] [2025-04-13 23:25:15,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130878335] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:15,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:15,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:15,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231567295] [2025-04-13 23:25:15,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:15,950 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:15,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:15,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:15,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:15,951 INFO L87 Difference]: Start difference. First operand 6523 states and 23957 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:16,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:16,890 INFO L93 Difference]: Finished difference Result 12771 states and 45345 transitions. [2025-04-13 23:25:16,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:16,891 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:25:16,891 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:16,936 INFO L225 Difference]: With dead ends: 12771 [2025-04-13 23:25:16,937 INFO L226 Difference]: Without dead ends: 12700 [2025-04-13 23:25:16,941 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 23:25:16,941 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 329 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1536 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:16,942 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 109 Invalid, 1563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1536 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:25:16,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12700 states. [2025-04-13 23:25:17,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12700 to 6563. [2025-04-13 23:25:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6563 states, 6562 states have (on average 3.671441633648278) internal successors, (24092), 6562 states have internal predecessors, (24092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6563 states to 6563 states and 24092 transitions. [2025-04-13 23:25:17,105 INFO L79 Accepts]: Start accepts. Automaton has 6563 states and 24092 transitions. Word has length 54 [2025-04-13 23:25:17,105 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:17,105 INFO L485 AbstractCegarLoop]: Abstraction has 6563 states and 24092 transitions. [2025-04-13 23:25:17,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 23:25:17,106 INFO L278 IsEmpty]: Start isEmpty. Operand 6563 states and 24092 transitions. [2025-04-13 23:25:17,116 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:17,117 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:17,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 23:25:17,117 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2025-04-13 23:25:17,117 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 23:25:17,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:17,117 INFO L85 PathProgramCache]: Analyzing trace with hash -237604339, now seen corresponding path program 90 times [2025-04-13 23:25:17,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:17,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438588614] [2025-04-13 23:25:17,117 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:25:17,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:17,120 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:17,130 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:17,130 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:25:17,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:17,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:17,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:17,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438588614] [2025-04-13 23:25:17,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438588614] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:17,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:17,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:17,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374772904] [2025-04-13 23:25:17,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:17,725 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:17,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:17,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:17,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:17,725 INFO L87 Difference]: Start difference. First operand 6563 states and 24092 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:18,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:18,662 INFO L93 Difference]: Finished difference Result 11238 states and 39938 transitions. [2025-04-13 23:25:18,662 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:18,662 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:25:18,662 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:18,703 INFO L225 Difference]: With dead ends: 11238 [2025-04-13 23:25:18,703 INFO L226 Difference]: Without dead ends: 11121 [2025-04-13 23:25:18,707 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:25:18,707 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 306 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:18,707 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 125 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:25:18,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11121 states. [2025-04-13 23:25:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11121 to 6662. [2025-04-13 23:25:18,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6662 states, 6661 states have (on average 3.6616123705149377) internal successors, (24390), 6661 states have internal predecessors, (24390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:18,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6662 states to 6662 states and 24390 transitions. [2025-04-13 23:25:18,857 INFO L79 Accepts]: Start accepts. Automaton has 6662 states and 24390 transitions. Word has length 54 [2025-04-13 23:25:18,857 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:18,857 INFO L485 AbstractCegarLoop]: Abstraction has 6662 states and 24390 transitions. [2025-04-13 23:25:18,857 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:18,857 INFO L278 IsEmpty]: Start isEmpty. Operand 6662 states and 24390 transitions. [2025-04-13 23:25:18,868 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:18,868 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:18,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 23:25:18,868 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2025-04-13 23:25:18,868 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 23:25:18,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:18,868 INFO L85 PathProgramCache]: Analyzing trace with hash 500636665, now seen corresponding path program 91 times [2025-04-13 23:25:18,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:18,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650111662] [2025-04-13 23:25:18,868 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:25:18,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:18,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:18,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:18,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:25:18,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:19,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:19,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:19,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650111662] [2025-04-13 23:25:19,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650111662] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:19,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:19,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:19,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515016551] [2025-04-13 23:25:19,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:19,470 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:19,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:19,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:19,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:19,470 INFO L87 Difference]: Start difference. First operand 6662 states and 24390 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:20,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:20,474 INFO L93 Difference]: Finished difference Result 12799 states and 45453 transitions. [2025-04-13 23:25:20,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:20,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 23:25:20,474 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:20,528 INFO L225 Difference]: With dead ends: 12799 [2025-04-13 23:25:20,528 INFO L226 Difference]: Without dead ends: 12721 [2025-04-13 23:25:20,534 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:25:20,534 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 276 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:20,534 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 126 Invalid, 1698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1673 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:25:20,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12721 states. [2025-04-13 23:25:20,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12721 to 6652. [2025-04-13 23:25:20,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6652 states, 6651 states have (on average 3.6618553600962263) internal successors, (24355), 6651 states have internal predecessors, (24355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:20,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6652 states to 6652 states and 24355 transitions. [2025-04-13 23:25:20,734 INFO L79 Accepts]: Start accepts. Automaton has 6652 states and 24355 transitions. Word has length 54 [2025-04-13 23:25:20,734 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:20,734 INFO L485 AbstractCegarLoop]: Abstraction has 6652 states and 24355 transitions. [2025-04-13 23:25:20,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 23:25:20,734 INFO L278 IsEmpty]: Start isEmpty. Operand 6652 states and 24355 transitions. [2025-04-13 23:25:20,745 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:20,745 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:20,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:20,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2025-04-13 23:25:20,745 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 23:25:20,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:20,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1672671829, now seen corresponding path program 92 times [2025-04-13 23:25:20,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:20,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873468137] [2025-04-13 23:25:20,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:25:20,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:20,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:20,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:20,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:25:20,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:21,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:21,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:21,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873468137] [2025-04-13 23:25:21,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873468137] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:21,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:21,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:21,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947698342] [2025-04-13 23:25:21,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:21,334 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:21,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:21,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:21,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:21,335 INFO L87 Difference]: Start difference. First operand 6652 states and 24355 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:22,245 INFO L93 Difference]: Finished difference Result 11263 states and 39963 transitions. [2025-04-13 23:25:22,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:22,245 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:25:22,245 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:22,289 INFO L225 Difference]: With dead ends: 11263 [2025-04-13 23:25:22,290 INFO L226 Difference]: Without dead ends: 11192 [2025-04-13 23:25:22,293 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:25:22,294 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 313 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 1574 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:22,294 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 124 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:25:22,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11192 states. [2025-04-13 23:25:22,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11192 to 6663. [2025-04-13 23:25:22,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6663 states, 6662 states have (on average 3.6598619033323327) internal successors, (24382), 6662 states have internal predecessors, (24382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:22,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6663 states to 6663 states and 24382 transitions. [2025-04-13 23:25:22,438 INFO L79 Accepts]: Start accepts. Automaton has 6663 states and 24382 transitions. Word has length 54 [2025-04-13 23:25:22,439 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:22,439 INFO L485 AbstractCegarLoop]: Abstraction has 6663 states and 24382 transitions. [2025-04-13 23:25:22,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:22,439 INFO L278 IsEmpty]: Start isEmpty. Operand 6663 states and 24382 transitions. [2025-04-13 23:25:22,449 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:22,449 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:22,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:22,449 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2025-04-13 23:25:22,450 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 23:25:22,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:22,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1414996507, now seen corresponding path program 93 times [2025-04-13 23:25:22,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:22,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637577440] [2025-04-13 23:25:22,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:25:22,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:22,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:22,464 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:22,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:25:22,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:23,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:23,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637577440] [2025-04-13 23:25:23,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637577440] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:23,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:23,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:23,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110956851] [2025-04-13 23:25:23,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:23,119 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:23,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:23,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:23,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:23,119 INFO L87 Difference]: Start difference. First operand 6663 states and 24382 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:24,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:24,059 INFO L93 Difference]: Finished difference Result 12849 states and 45586 transitions. [2025-04-13 23:25:24,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:24,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 23:25:24,060 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:24,108 INFO L225 Difference]: With dead ends: 12849 [2025-04-13 23:25:24,108 INFO L226 Difference]: Without dead ends: 12712 [2025-04-13 23:25:24,113 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:25:24,114 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 312 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:24,114 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 104 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:25:24,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12712 states. [2025-04-13 23:25:24,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12712 to 6643. [2025-04-13 23:25:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6643 states, 6642 states have (on average 3.6603432700993674) internal successors, (24312), 6642 states have internal predecessors, (24312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6643 states to 6643 states and 24312 transitions. [2025-04-13 23:25:24,272 INFO L79 Accepts]: Start accepts. Automaton has 6643 states and 24312 transitions. Word has length 54 [2025-04-13 23:25:24,272 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:24,272 INFO L485 AbstractCegarLoop]: Abstraction has 6643 states and 24312 transitions. [2025-04-13 23:25:24,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 23:25:24,272 INFO L278 IsEmpty]: Start isEmpty. Operand 6643 states and 24312 transitions. [2025-04-13 23:25:24,283 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:24,283 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:24,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:24,283 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2025-04-13 23:25:24,283 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 23:25:24,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:24,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1682160141, now seen corresponding path program 94 times [2025-04-13 23:25:24,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:24,284 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476596934] [2025-04-13 23:25:24,284 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:25:24,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:24,287 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:25:24,300 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 23:25:24,300 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:25:24,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:24,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:24,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:24,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476596934] [2025-04-13 23:25:24,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476596934] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:24,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:24,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:24,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547606331] [2025-04-13 23:25:24,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:24,954 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:24,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:24,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:24,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:24,955 INFO L87 Difference]: Start difference. First operand 6643 states and 24312 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:25,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:25,879 INFO L93 Difference]: Finished difference Result 11172 states and 39702 transitions. [2025-04-13 23:25:25,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:25,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 23:25:25,880 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:25,921 INFO L225 Difference]: With dead ends: 11172 [2025-04-13 23:25:25,922 INFO L226 Difference]: Without dead ends: 11069 [2025-04-13 23:25:25,926 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:25:25,926 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 301 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:25,926 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 109 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:25:25,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11069 states. [2025-04-13 23:25:26,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11069 to 6610. [2025-04-13 23:25:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6610 states, 6609 states have (on average 3.6630352549553638) internal successors, (24209), 6609 states have internal predecessors, (24209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:26,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6610 states to 6610 states and 24209 transitions. [2025-04-13 23:25:26,075 INFO L79 Accepts]: Start accepts. Automaton has 6610 states and 24209 transitions. Word has length 54 [2025-04-13 23:25:26,075 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:26,075 INFO L485 AbstractCegarLoop]: Abstraction has 6610 states and 24209 transitions. [2025-04-13 23:25:26,075 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:26,075 INFO L278 IsEmpty]: Start isEmpty. Operand 6610 states and 24209 transitions. [2025-04-13 23:25:26,086 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:26,086 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:26,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:26,086 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2025-04-13 23:25:26,086 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 23:25:26,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:26,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1836787141, now seen corresponding path program 95 times [2025-04-13 23:25:26,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:26,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033012008] [2025-04-13 23:25:26,087 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:25:26,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:26,090 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:26,100 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:26,100 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:25:26,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:26,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:26,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:26,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033012008] [2025-04-13 23:25:26,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033012008] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:26,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:26,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:26,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347541537] [2025-04-13 23:25:26,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:26,691 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:26,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:26,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:26,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:26,692 INFO L87 Difference]: Start difference. First operand 6610 states and 24209 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:27,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:27,634 INFO L93 Difference]: Finished difference Result 12846 states and 45550 transitions. [2025-04-13 23:25:27,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:27,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 23:25:27,634 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:27,676 INFO L225 Difference]: With dead ends: 12846 [2025-04-13 23:25:27,676 INFO L226 Difference]: Without dead ends: 12775 [2025-04-13 23:25:27,679 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 23:25:27,680 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 321 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1563 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:27,680 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 111 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1563 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:25:27,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12775 states. [2025-04-13 23:25:27,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12775 to 6625. [2025-04-13 23:25:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6625 states, 6624 states have (on average 3.6615338164251208) internal successors, (24254), 6624 states have internal predecessors, (24254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6625 states to 6625 states and 24254 transitions. [2025-04-13 23:25:27,832 INFO L79 Accepts]: Start accepts. Automaton has 6625 states and 24254 transitions. Word has length 54 [2025-04-13 23:25:27,833 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:27,833 INFO L485 AbstractCegarLoop]: Abstraction has 6625 states and 24254 transitions. [2025-04-13 23:25:27,833 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:27,833 INFO L278 IsEmpty]: Start isEmpty. Operand 6625 states and 24254 transitions. [2025-04-13 23:25:27,844 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:27,844 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:27,844 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:27,844 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2025-04-13 23:25:27,844 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 23:25:27,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:27,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1591272773, now seen corresponding path program 96 times [2025-04-13 23:25:27,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:27,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84254034] [2025-04-13 23:25:27,845 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:25:27,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:27,848 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:27,858 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:27,858 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:25:27,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:28,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:28,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84254034] [2025-04-13 23:25:28,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84254034] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:28,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:28,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:28,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173586031] [2025-04-13 23:25:28,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:28,477 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:28,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:28,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:28,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:28,477 INFO L87 Difference]: Start difference. First operand 6625 states and 24254 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:29,484 INFO L93 Difference]: Finished difference Result 11176 states and 39709 transitions. [2025-04-13 23:25:29,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:29,484 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:25:29,484 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:29,527 INFO L225 Difference]: With dead ends: 11176 [2025-04-13 23:25:29,527 INFO L226 Difference]: Without dead ends: 11105 [2025-04-13 23:25:29,530 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:25:29,531 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 311 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:29,531 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 121 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:25:29,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11105 states. [2025-04-13 23:25:29,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11105 to 6658. [2025-04-13 23:25:29,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6658 states, 6657 states have (on average 3.658855340243353) internal successors, (24357), 6657 states have internal predecessors, (24357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:29,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6658 states to 6658 states and 24357 transitions. [2025-04-13 23:25:29,680 INFO L79 Accepts]: Start accepts. Automaton has 6658 states and 24357 transitions. Word has length 54 [2025-04-13 23:25:29,680 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:29,680 INFO L485 AbstractCegarLoop]: Abstraction has 6658 states and 24357 transitions. [2025-04-13 23:25:29,680 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:29,680 INFO L278 IsEmpty]: Start isEmpty. Operand 6658 states and 24357 transitions. [2025-04-13 23:25:29,691 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:29,691 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:29,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 23:25:29,691 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2025-04-13 23:25:29,691 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 23:25:29,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:29,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1036782565, now seen corresponding path program 97 times [2025-04-13 23:25:29,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:29,692 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712689439] [2025-04-13 23:25:29,692 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:25:29,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:29,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:29,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:29,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:25:29,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:30,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 23:25:30,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:30,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712689439] [2025-04-13 23:25:30,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712689439] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:30,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:30,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:30,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740467237] [2025-04-13 23:25:30,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:30,351 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:30,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:30,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:30,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:30,352 INFO L87 Difference]: Start difference. First operand 6658 states and 24357 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:31,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:31,247 INFO L93 Difference]: Finished difference Result 12876 states and 45636 transitions. [2025-04-13 23:25:31,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:31,247 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:25:31,247 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:31,292 INFO L225 Difference]: With dead ends: 12876 [2025-04-13 23:25:31,292 INFO L226 Difference]: Without dead ends: 12798 [2025-04-13 23:25:31,296 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 23:25:31,297 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 317 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 105 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.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:31,297 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 105 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:25:31,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12798 states. [2025-04-13 23:25:31,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12798 to 6648. [2025-04-13 23:25:31,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6648 states, 6647 states have (on average 3.659846547314578) internal successors, (24327), 6647 states have internal predecessors, (24327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:31,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6648 states to 6648 states and 24327 transitions. [2025-04-13 23:25:31,450 INFO L79 Accepts]: Start accepts. Automaton has 6648 states and 24327 transitions. Word has length 54 [2025-04-13 23:25:31,450 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:31,450 INFO L485 AbstractCegarLoop]: Abstraction has 6648 states and 24327 transitions. [2025-04-13 23:25:31,450 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:31,450 INFO L278 IsEmpty]: Start isEmpty. Operand 6648 states and 24327 transitions. [2025-04-13 23:25:31,461 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:31,461 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:31,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 23:25:31,461 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2025-04-13 23:25:31,461 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 23:25:31,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:31,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1763559197, now seen corresponding path program 98 times [2025-04-13 23:25:31,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:31,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976620164] [2025-04-13 23:25:31,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:25:31,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:31,465 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:31,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:31,475 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:25:31,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:32,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 23:25:32,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:32,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976620164] [2025-04-13 23:25:32,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976620164] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:32,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:32,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:32,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355058495] [2025-04-13 23:25:32,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:32,118 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:32,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:32,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:32,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:32,118 INFO L87 Difference]: Start difference. First operand 6648 states and 24327 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:33,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:33,178 INFO L93 Difference]: Finished difference Result 11165 states and 39666 transitions. [2025-04-13 23:25:33,178 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:33,178 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:25:33,178 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:33,219 INFO L225 Difference]: With dead ends: 11165 [2025-04-13 23:25:33,219 INFO L226 Difference]: Without dead ends: 11084 [2025-04-13 23:25:33,222 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:25:33,223 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 287 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:33,223 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 127 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:25:33,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11084 states. [2025-04-13 23:25:33,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11084 to 6637. [2025-04-13 23:25:33,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6637 states, 6636 states have (on average 3.660186859553948) internal successors, (24289), 6636 states have internal predecessors, (24289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:33,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6637 states to 6637 states and 24289 transitions. [2025-04-13 23:25:33,372 INFO L79 Accepts]: Start accepts. Automaton has 6637 states and 24289 transitions. Word has length 54 [2025-04-13 23:25:33,373 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:33,373 INFO L485 AbstractCegarLoop]: Abstraction has 6637 states and 24289 transitions. [2025-04-13 23:25:33,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:33,373 INFO L278 IsEmpty]: Start isEmpty. Operand 6637 states and 24289 transitions. [2025-04-13 23:25:33,383 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:33,383 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:33,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 23:25:33,383 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2025-04-13 23:25:33,383 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 23:25:33,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:33,384 INFO L85 PathProgramCache]: Analyzing trace with hash 48199193, now seen corresponding path program 99 times [2025-04-13 23:25:33,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:33,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176861210] [2025-04-13 23:25:33,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:25:33,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:33,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:33,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:33,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:25:33,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:34,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 23:25:34,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:34,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176861210] [2025-04-13 23:25:34,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176861210] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:34,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:34,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:34,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767754671] [2025-04-13 23:25:34,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:34,066 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:34,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:34,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:34,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:34,067 INFO L87 Difference]: Start difference. First operand 6637 states and 24289 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:35,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:35,027 INFO L93 Difference]: Finished difference Result 12868 states and 45611 transitions. [2025-04-13 23:25:35,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:35,028 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:25:35,028 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:35,073 INFO L225 Difference]: With dead ends: 12868 [2025-04-13 23:25:35,074 INFO L226 Difference]: Without dead ends: 12797 [2025-04-13 23:25:35,078 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 23:25:35,078 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 301 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:35,078 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 119 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:25:35,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12797 states. [2025-04-13 23:25:35,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12797 to 6648. [2025-04-13 23:25:35,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6648 states, 6647 states have (on average 3.6581916654129683) internal successors, (24316), 6647 states have internal predecessors, (24316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:35,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6648 states to 6648 states and 24316 transitions. [2025-04-13 23:25:35,239 INFO L79 Accepts]: Start accepts. Automaton has 6648 states and 24316 transitions. Word has length 54 [2025-04-13 23:25:35,240 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:35,240 INFO L485 AbstractCegarLoop]: Abstraction has 6648 states and 24316 transitions. [2025-04-13 23:25:35,240 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:35,240 INFO L278 IsEmpty]: Start isEmpty. Operand 6648 states and 24316 transitions. [2025-04-13 23:25:35,250 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:35,251 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:35,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 23:25:35,251 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2025-04-13 23:25:35,251 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 23:25:35,251 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:35,251 INFO L85 PathProgramCache]: Analyzing trace with hash -917841365, now seen corresponding path program 100 times [2025-04-13 23:25:35,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:35,251 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151767777] [2025-04-13 23:25:35,251 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:25:35,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:35,254 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:25:35,265 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 23:25:35,265 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:25:35,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:35,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:35,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:35,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151767777] [2025-04-13 23:25:35,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151767777] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:35,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:35,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:35,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986872471] [2025-04-13 23:25:35,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:35,891 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:35,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:35,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:35,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:35,892 INFO L87 Difference]: Start difference. First operand 6648 states and 24316 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:36,917 INFO L93 Difference]: Finished difference Result 11095 states and 39477 transitions. [2025-04-13 23:25:36,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:36,917 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:25:36,917 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:36,954 INFO L225 Difference]: With dead ends: 11095 [2025-04-13 23:25:36,954 INFO L226 Difference]: Without dead ends: 10817 [2025-04-13 23:25:36,957 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:25:36,957 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 266 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 1766 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:36,957 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 146 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1766 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:25:36,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10817 states. [2025-04-13 23:25:37,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10817 to 6484. [2025-04-13 23:25:37,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6484 states, 6483 states have (on average 3.675613142063859) internal successors, (23829), 6483 states have internal predecessors, (23829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:37,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6484 states to 6484 states and 23829 transitions. [2025-04-13 23:25:37,092 INFO L79 Accepts]: Start accepts. Automaton has 6484 states and 23829 transitions. Word has length 54 [2025-04-13 23:25:37,092 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:37,092 INFO L485 AbstractCegarLoop]: Abstraction has 6484 states and 23829 transitions. [2025-04-13 23:25:37,092 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:37,092 INFO L278 IsEmpty]: Start isEmpty. Operand 6484 states and 23829 transitions. [2025-04-13 23:25:37,102 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:37,103 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:37,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:37,103 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2025-04-13 23:25:37,103 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 23:25:37,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:37,103 INFO L85 PathProgramCache]: Analyzing trace with hash -891936133, now seen corresponding path program 101 times [2025-04-13 23:25:37,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:37,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825289878] [2025-04-13 23:25:37,103 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:25:37,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:37,106 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:37,116 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:37,116 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:25:37,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:37,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:37,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:37,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825289878] [2025-04-13 23:25:37,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825289878] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:37,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:37,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:37,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280924517] [2025-04-13 23:25:37,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:37,721 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:37,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:37,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:37,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:37,722 INFO L87 Difference]: Start difference. First operand 6484 states and 23829 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:38,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:38,628 INFO L93 Difference]: Finished difference Result 12655 states and 44998 transitions. [2025-04-13 23:25:38,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:38,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 23:25:38,629 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:38,686 INFO L225 Difference]: With dead ends: 12655 [2025-04-13 23:25:38,686 INFO L226 Difference]: Without dead ends: 12574 [2025-04-13 23:25:38,692 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 23:25:38,692 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 317 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1517 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:38,692 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 106 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1517 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:25:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12574 states. [2025-04-13 23:25:38,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12574 to 6473. [2025-04-13 23:25:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6473 states, 6472 states have (on average 3.6769159456118663) internal successors, (23797), 6472 states have internal predecessors, (23797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:38,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6473 states to 6473 states and 23797 transitions. [2025-04-13 23:25:38,866 INFO L79 Accepts]: Start accepts. Automaton has 6473 states and 23797 transitions. Word has length 54 [2025-04-13 23:25:38,867 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:38,867 INFO L485 AbstractCegarLoop]: Abstraction has 6473 states and 23797 transitions. [2025-04-13 23:25:38,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 23:25:38,867 INFO L278 IsEmpty]: Start isEmpty. Operand 6473 states and 23797 transitions. [2025-04-13 23:25:38,877 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:38,878 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:38,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:38,878 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2025-04-13 23:25:38,878 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 23:25:38,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:38,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1522717553, now seen corresponding path program 102 times [2025-04-13 23:25:38,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:38,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070227301] [2025-04-13 23:25:38,878 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:25:38,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:38,881 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:38,891 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:38,891 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:25:38,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:39,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:39,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:39,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070227301] [2025-04-13 23:25:39,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070227301] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:39,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:39,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:39,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603827360] [2025-04-13 23:25:39,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:39,544 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:39,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:39,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:39,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:39,544 INFO L87 Difference]: Start difference. First operand 6473 states and 23797 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:40,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:40,403 INFO L93 Difference]: Finished difference Result 11416 states and 40537 transitions. [2025-04-13 23:25:40,404 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:40,404 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:25:40,404 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:40,447 INFO L225 Difference]: With dead ends: 11416 [2025-04-13 23:25:40,447 INFO L226 Difference]: Without dead ends: 11348 [2025-04-13 23:25:40,451 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:25:40,452 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 334 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:40,452 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 136 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:25:40,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11348 states. [2025-04-13 23:25:40,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11348 to 6586. [2025-04-13 23:25:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6586 states, 6585 states have (on average 3.6736522399392557) internal successors, (24191), 6585 states have internal predecessors, (24191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:40,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6586 states to 6586 states and 24191 transitions. [2025-04-13 23:25:40,608 INFO L79 Accepts]: Start accepts. Automaton has 6586 states and 24191 transitions. Word has length 54 [2025-04-13 23:25:40,608 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:40,609 INFO L485 AbstractCegarLoop]: Abstraction has 6586 states and 24191 transitions. [2025-04-13 23:25:40,609 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:40,609 INFO L278 IsEmpty]: Start isEmpty. Operand 6586 states and 24191 transitions. [2025-04-13 23:25:40,619 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:40,619 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:40,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 23:25:40,620 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2025-04-13 23:25:40,620 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 23:25:40,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:40,620 INFO L85 PathProgramCache]: Analyzing trace with hash -116206599, now seen corresponding path program 103 times [2025-04-13 23:25:40,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:40,620 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892454520] [2025-04-13 23:25:40,620 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:25:40,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:40,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:40,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:40,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:25:40,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:41,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 23:25:41,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:41,269 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892454520] [2025-04-13 23:25:41,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892454520] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:41,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:41,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:41,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774423366] [2025-04-13 23:25:41,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:41,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:41,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:41,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:41,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:41,270 INFO L87 Difference]: Start difference. First operand 6586 states and 24191 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:42,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:42,235 INFO L93 Difference]: Finished difference Result 12713 states and 45230 transitions. [2025-04-13 23:25:42,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:42,236 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:25:42,236 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:42,285 INFO L225 Difference]: With dead ends: 12713 [2025-04-13 23:25:42,285 INFO L226 Difference]: Without dead ends: 12645 [2025-04-13 23:25:42,290 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:25:42,290 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 295 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:42,290 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 106 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1522 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:25:42,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12645 states. [2025-04-13 23:25:42,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12645 to 6596. [2025-04-13 23:25:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6596 states, 6595 states have (on average 3.6718726307808947) internal successors, (24216), 6595 states have internal predecessors, (24216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:42,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6596 states to 6596 states and 24216 transitions. [2025-04-13 23:25:42,455 INFO L79 Accepts]: Start accepts. Automaton has 6596 states and 24216 transitions. Word has length 54 [2025-04-13 23:25:42,456 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:42,456 INFO L485 AbstractCegarLoop]: Abstraction has 6596 states and 24216 transitions. [2025-04-13 23:25:42,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 23:25:42,456 INFO L278 IsEmpty]: Start isEmpty. Operand 6596 states and 24216 transitions. [2025-04-13 23:25:42,467 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:42,467 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:42,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 23:25:42,467 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2025-04-13 23:25:42,467 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 23:25:42,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:42,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1972245167, now seen corresponding path program 104 times [2025-04-13 23:25:42,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:42,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626033153] [2025-04-13 23:25:42,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:25:42,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:42,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:42,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:42,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:25:42,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:43,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:43,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:43,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626033153] [2025-04-13 23:25:43,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626033153] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:43,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:43,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:43,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842709065] [2025-04-13 23:25:43,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:43,077 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:43,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:43,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:43,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:43,077 INFO L87 Difference]: Start difference. First operand 6596 states and 24216 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:44,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:44,051 INFO L93 Difference]: Finished difference Result 11429 states and 40559 transitions. [2025-04-13 23:25:44,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:44,051 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:25:44,051 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:44,095 INFO L225 Difference]: With dead ends: 11429 [2025-04-13 23:25:44,095 INFO L226 Difference]: Without dead ends: 11348 [2025-04-13 23:25:44,099 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:25:44,099 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 334 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:44,099 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 132 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1605 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:25:44,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11348 states. [2025-04-13 23:25:44,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11348 to 6586. [2025-04-13 23:25:44,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6586 states, 6585 states have (on average 3.6721336370539106) internal successors, (24181), 6585 states have internal predecessors, (24181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:44,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6586 states to 6586 states and 24181 transitions. [2025-04-13 23:25:44,254 INFO L79 Accepts]: Start accepts. Automaton has 6586 states and 24181 transitions. Word has length 54 [2025-04-13 23:25:44,254 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:44,255 INFO L485 AbstractCegarLoop]: Abstraction has 6586 states and 24181 transitions. [2025-04-13 23:25:44,255 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:44,255 INFO L278 IsEmpty]: Start isEmpty. Operand 6586 states and 24181 transitions. [2025-04-13 23:25:44,266 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:44,266 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:44,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:44,266 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2025-04-13 23:25:44,266 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 23:25:44,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:44,266 INFO L85 PathProgramCache]: Analyzing trace with hash -886684581, now seen corresponding path program 105 times [2025-04-13 23:25:44,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:44,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819621167] [2025-04-13 23:25:44,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:25:44,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:44,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:44,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:44,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:25:44,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:44,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 23:25:44,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:44,881 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819621167] [2025-04-13 23:25:44,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819621167] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:44,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:44,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:44,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460818611] [2025-04-13 23:25:44,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:44,881 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:44,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:44,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:44,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:44,882 INFO L87 Difference]: Start difference. First operand 6586 states and 24181 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:45,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:45,876 INFO L93 Difference]: Finished difference Result 12657 states and 45077 transitions. [2025-04-13 23:25:45,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:45,877 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:25:45,877 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:45,923 INFO L225 Difference]: With dead ends: 12657 [2025-04-13 23:25:45,923 INFO L226 Difference]: Without dead ends: 12572 [2025-04-13 23:25:45,926 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 23:25:45,926 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 246 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:45,926 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 129 Invalid, 1750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1726 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:25:45,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12572 states. [2025-04-13 23:25:46,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12572 to 6571. [2025-04-13 23:25:46,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6571 states, 6570 states have (on average 3.6744292237442924) internal successors, (24141), 6570 states have internal predecessors, (24141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:46,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6571 states to 6571 states and 24141 transitions. [2025-04-13 23:25:46,072 INFO L79 Accepts]: Start accepts. Automaton has 6571 states and 24141 transitions. Word has length 54 [2025-04-13 23:25:46,072 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:46,072 INFO L485 AbstractCegarLoop]: Abstraction has 6571 states and 24141 transitions. [2025-04-13 23:25:46,072 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:46,073 INFO L278 IsEmpty]: Start isEmpty. Operand 6571 states and 24141 transitions. [2025-04-13 23:25:46,083 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:46,083 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:46,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 23:25:46,083 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2025-04-13 23:25:46,084 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 23:25:46,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:46,084 INFO L85 PathProgramCache]: Analyzing trace with hash -608357711, now seen corresponding path program 106 times [2025-04-13 23:25:46,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:46,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587759812] [2025-04-13 23:25:46,084 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:25:46,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:46,087 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:25:46,098 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 23:25:46,099 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:25:46,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:46,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 23:25:46,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:46,720 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587759812] [2025-04-13 23:25:46,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587759812] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:46,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:46,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:46,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275723618] [2025-04-13 23:25:46,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:46,720 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:46,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:46,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:46,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:46,721 INFO L87 Difference]: Start difference. First operand 6571 states and 24141 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:47,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:47,862 INFO L93 Difference]: Finished difference Result 11450 states and 40618 transitions. [2025-04-13 23:25:47,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:47,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 23:25:47,862 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:47,908 INFO L225 Difference]: With dead ends: 11450 [2025-04-13 23:25:47,908 INFO L226 Difference]: Without dead ends: 11313 [2025-04-13 23:25:47,912 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:25:47,913 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 304 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1754 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:47,913 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 147 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1754 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:25:47,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11313 states. [2025-04-13 23:25:48,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11313 to 6551. [2025-04-13 23:25:48,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6551 states, 6550 states have (on average 3.6749618320610686) internal successors, (24071), 6550 states have internal predecessors, (24071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:48,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6551 states to 6551 states and 24071 transitions. [2025-04-13 23:25:48,116 INFO L79 Accepts]: Start accepts. Automaton has 6551 states and 24071 transitions. Word has length 54 [2025-04-13 23:25:48,116 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:48,116 INFO L485 AbstractCegarLoop]: Abstraction has 6551 states and 24071 transitions. [2025-04-13 23:25:48,116 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:48,117 INFO L278 IsEmpty]: Start isEmpty. Operand 6551 states and 24071 transitions. [2025-04-13 23:25:48,127 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:48,127 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:48,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:48,128 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2025-04-13 23:25:48,128 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 23:25:48,128 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:48,128 INFO L85 PathProgramCache]: Analyzing trace with hash -279969283, now seen corresponding path program 107 times [2025-04-13 23:25:48,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:48,128 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317601322] [2025-04-13 23:25:48,128 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:25:48,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:48,131 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:48,142 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:48,142 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:25:48,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:48,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:48,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317601322] [2025-04-13 23:25:48,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317601322] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:48,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:48,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:48,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404613208] [2025-04-13 23:25:48,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:48,750 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:48,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:48,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:48,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:48,750 INFO L87 Difference]: Start difference. First operand 6551 states and 24071 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:49,677 INFO L93 Difference]: Finished difference Result 12590 states and 44866 transitions. [2025-04-13 23:25:49,677 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:49,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 23:25:49,677 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:49,728 INFO L225 Difference]: With dead ends: 12590 [2025-04-13 23:25:49,728 INFO L226 Difference]: Without dead ends: 12473 [2025-04-13 23:25:49,733 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:25:49,734 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 290 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:49,734 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 100 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:25:49,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12473 states. [2025-04-13 23:25:49,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12473 to 6573. [2025-04-13 23:25:49,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6573 states, 6572 states have (on average 3.670876445526476) internal successors, (24125), 6572 states have internal predecessors, (24125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:49,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6573 states to 6573 states and 24125 transitions. [2025-04-13 23:25:49,915 INFO L79 Accepts]: Start accepts. Automaton has 6573 states and 24125 transitions. Word has length 54 [2025-04-13 23:25:49,916 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:49,916 INFO L485 AbstractCegarLoop]: Abstraction has 6573 states and 24125 transitions. [2025-04-13 23:25:49,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 23:25:49,916 INFO L278 IsEmpty]: Start isEmpty. Operand 6573 states and 24125 transitions. [2025-04-13 23:25:49,927 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:49,927 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:49,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:49,928 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2025-04-13 23:25:49,928 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 23:25:49,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:49,928 INFO L85 PathProgramCache]: Analyzing trace with hash 493878415, now seen corresponding path program 108 times [2025-04-13 23:25:49,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:49,928 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504573349] [2025-04-13 23:25:49,928 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:25:49,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:49,931 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:49,941 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:49,942 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:25:49,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:50,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 23:25:50,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:50,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504573349] [2025-04-13 23:25:50,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504573349] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:50,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:50,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:50,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054157230] [2025-04-13 23:25:50,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:50,512 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:50,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:50,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:50,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:50,513 INFO L87 Difference]: Start difference. First operand 6573 states and 24125 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:51,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:51,503 INFO L93 Difference]: Finished difference Result 11600 states and 41007 transitions. [2025-04-13 23:25:51,503 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:51,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 23:25:51,503 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:51,546 INFO L225 Difference]: With dead ends: 11600 [2025-04-13 23:25:51,546 INFO L226 Difference]: Without dead ends: 11532 [2025-04-13 23:25:51,550 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:25:51,550 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 325 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 1795 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:51,550 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 151 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1795 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:25:51,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11532 states. [2025-04-13 23:25:51,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11532 to 6588. [2025-04-13 23:25:51,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6588 states, 6587 states have (on average 3.6693487171701835) internal successors, (24170), 6587 states have internal predecessors, (24170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6588 states to 6588 states and 24170 transitions. [2025-04-13 23:25:51,702 INFO L79 Accepts]: Start accepts. Automaton has 6588 states and 24170 transitions. Word has length 54 [2025-04-13 23:25:51,703 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:51,703 INFO L485 AbstractCegarLoop]: Abstraction has 6588 states and 24170 transitions. [2025-04-13 23:25:51,703 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:51,703 INFO L278 IsEmpty]: Start isEmpty. Operand 6588 states and 24170 transitions. [2025-04-13 23:25:51,713 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:51,714 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:51,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:51,714 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2025-04-13 23:25:51,714 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 23:25:51,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:51,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1715036773, now seen corresponding path program 109 times [2025-04-13 23:25:51,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:51,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633522097] [2025-04-13 23:25:51,714 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:25:51,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:51,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:51,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:51,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:25:51,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:52,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 23:25:52,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:52,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633522097] [2025-04-13 23:25:52,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633522097] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:52,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:52,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:52,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296265886] [2025-04-13 23:25:52,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:52,359 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:52,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:52,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:52,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:52,359 INFO L87 Difference]: Start difference. First operand 6588 states and 24170 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:53,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:53,321 INFO L93 Difference]: Finished difference Result 12569 states and 44791 transitions. [2025-04-13 23:25:53,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:53,322 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:25:53,322 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:53,368 INFO L225 Difference]: With dead ends: 12569 [2025-04-13 23:25:53,368 INFO L226 Difference]: Without dead ends: 12498 [2025-04-13 23:25:53,373 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 23:25:53,373 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 244 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:53,373 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 116 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1617 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:25:53,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12498 states. [2025-04-13 23:25:53,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12498 to 6599. [2025-04-13 23:25:53,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6599 states, 6598 states have (on average 3.6673234313428313) internal successors, (24197), 6598 states have internal predecessors, (24197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:53,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6599 states to 6599 states and 24197 transitions. [2025-04-13 23:25:53,529 INFO L79 Accepts]: Start accepts. Automaton has 6599 states and 24197 transitions. Word has length 54 [2025-04-13 23:25:53,529 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:53,529 INFO L485 AbstractCegarLoop]: Abstraction has 6599 states and 24197 transitions. [2025-04-13 23:25:53,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 23:25:53,529 INFO L278 IsEmpty]: Start isEmpty. Operand 6599 states and 24197 transitions. [2025-04-13 23:25:53,540 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:53,540 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:53,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:53,540 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2025-04-13 23:25:53,540 INFO L403 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:25:53,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:53,541 INFO L85 PathProgramCache]: Analyzing trace with hash -306126161, now seen corresponding path program 110 times [2025-04-13 23:25:53,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:53,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916942639] [2025-04-13 23:25:53,541 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:25:53,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:53,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:53,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:53,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:25:53,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:54,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:54,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:54,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916942639] [2025-04-13 23:25:54,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916942639] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:54,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:54,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:54,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759778778] [2025-04-13 23:25:54,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:54,146 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:54,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:54,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:54,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:54,146 INFO L87 Difference]: Start difference. First operand 6599 states and 24197 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:55,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:55,116 INFO L93 Difference]: Finished difference Result 11614 states and 41031 transitions. [2025-04-13 23:25:55,116 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:55,116 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:25:55,116 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:55,159 INFO L225 Difference]: With dead ends: 11614 [2025-04-13 23:25:55,159 INFO L226 Difference]: Without dead ends: 11533 [2025-04-13 23:25:55,162 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:25:55,162 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 358 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:55,162 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 129 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:25:55,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11533 states. [2025-04-13 23:25:55,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11533 to 6589. [2025-04-13 23:25:55,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6589 states, 6588 states have (on average 3.6683363691560413) internal successors, (24167), 6588 states have internal predecessors, (24167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:55,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6589 states to 6589 states and 24167 transitions. [2025-04-13 23:25:55,304 INFO L79 Accepts]: Start accepts. Automaton has 6589 states and 24167 transitions. Word has length 54 [2025-04-13 23:25:55,304 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:55,304 INFO L485 AbstractCegarLoop]: Abstraction has 6589 states and 24167 transitions. [2025-04-13 23:25:55,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:55,304 INFO L278 IsEmpty]: Start isEmpty. Operand 6589 states and 24167 transitions. [2025-04-13 23:25:55,315 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:55,315 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:55,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:55,315 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2025-04-13 23:25:55,315 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 23:25:55,315 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:55,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1639795197, now seen corresponding path program 111 times [2025-04-13 23:25:55,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:55,316 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067112708] [2025-04-13 23:25:55,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:25:55,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:55,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:55,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:55,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:25:55,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:55,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:55,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067112708] [2025-04-13 23:25:55,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067112708] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:55,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:55,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:55,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544176986] [2025-04-13 23:25:55,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:55,925 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:55,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:55,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:55,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:55,926 INFO L87 Difference]: Start difference. First operand 6589 states and 24167 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:56,810 INFO L93 Difference]: Finished difference Result 12488 states and 44570 transitions. [2025-04-13 23:25:56,810 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:56,810 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:25:56,810 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:56,861 INFO L225 Difference]: With dead ends: 12488 [2025-04-13 23:25:56,861 INFO L226 Difference]: Without dead ends: 12375 [2025-04-13 23:25:56,866 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 23:25:56,866 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 254 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:56,866 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 105 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:25:56,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12375 states. [2025-04-13 23:25:56,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12375 to 6546. [2025-04-13 23:25:56,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6546 states, 6545 states have (on average 3.6747135217723454) internal successors, (24051), 6545 states have internal predecessors, (24051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6546 states to 6546 states and 24051 transitions. [2025-04-13 23:25:57,024 INFO L79 Accepts]: Start accepts. Automaton has 6546 states and 24051 transitions. Word has length 54 [2025-04-13 23:25:57,024 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:57,024 INFO L485 AbstractCegarLoop]: Abstraction has 6546 states and 24051 transitions. [2025-04-13 23:25:57,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:57,024 INFO L278 IsEmpty]: Start isEmpty. Operand 6546 states and 24051 transitions. [2025-04-13 23:25:57,035 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:57,035 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:57,035 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:25:57,035 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2025-04-13 23:25:57,035 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 23:25:57,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:57,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1414454381, now seen corresponding path program 112 times [2025-04-13 23:25:57,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:57,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280979384] [2025-04-13 23:25:57,036 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:25:57,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:57,038 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:25:57,049 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 23:25:57,049 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:25:57,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:57,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:57,618 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280979384] [2025-04-13 23:25:57,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280979384] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:57,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:57,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:57,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451039772] [2025-04-13 23:25:57,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:57,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:57,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:57,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:57,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:57,619 INFO L87 Difference]: Start difference. First operand 6546 states and 24051 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:58,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:58,452 INFO L93 Difference]: Finished difference Result 11467 states and 40638 transitions. [2025-04-13 23:25:58,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:58,452 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:25:58,452 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:58,503 INFO L225 Difference]: With dead ends: 11467 [2025-04-13 23:25:58,504 INFO L226 Difference]: Without dead ends: 11399 [2025-04-13 23:25:58,507 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:25:58,508 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 330 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:58,508 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 121 Invalid, 1504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:25:58,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11399 states. [2025-04-13 23:25:58,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11399 to 6556. [2025-04-13 23:25:58,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6556 states, 6555 states have (on average 3.672921434019832) internal successors, (24076), 6555 states have internal predecessors, (24076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6556 states to 6556 states and 24076 transitions. [2025-04-13 23:25:58,661 INFO L79 Accepts]: Start accepts. Automaton has 6556 states and 24076 transitions. Word has length 54 [2025-04-13 23:25:58,661 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:58,661 INFO L485 AbstractCegarLoop]: Abstraction has 6556 states and 24076 transitions. [2025-04-13 23:25:58,661 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:58,661 INFO L278 IsEmpty]: Start isEmpty. Operand 6556 states and 24076 transitions. [2025-04-13 23:25:58,672 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:25:58,672 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:58,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 23:25:58,672 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2025-04-13 23:25:58,672 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 23:25:58,672 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:58,672 INFO L85 PathProgramCache]: Analyzing trace with hash 620455929, now seen corresponding path program 113 times [2025-04-13 23:25:58,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:58,672 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859515740] [2025-04-13 23:25:58,672 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:25:58,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:58,675 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:25:58,686 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:25:58,686 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:25:58,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:59,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:25:59,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:59,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859515740] [2025-04-13 23:25:59,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859515740] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:25:59,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:25:59,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:25:59,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747749448] [2025-04-13 23:25:59,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:25:59,356 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:25:59,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:59,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:25:59,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:25:59,357 INFO L87 Difference]: Start difference. First operand 6556 states and 24076 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:00,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:00,349 INFO L93 Difference]: Finished difference Result 12725 states and 45264 transitions. [2025-04-13 23:26:00,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:00,349 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:26:00,349 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:00,396 INFO L225 Difference]: With dead ends: 12725 [2025-04-13 23:26:00,396 INFO L226 Difference]: Without dead ends: 12654 [2025-04-13 23:26:00,401 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 23:26:00,401 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 277 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:00,401 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 115 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:26:00,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12654 states. [2025-04-13 23:26:00,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12654 to 6596. [2025-04-13 23:26:00,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6596 states, 6595 states have (on average 3.671114480667172) internal successors, (24211), 6595 states have internal predecessors, (24211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6596 states to 6596 states and 24211 transitions. [2025-04-13 23:26:00,559 INFO L79 Accepts]: Start accepts. Automaton has 6596 states and 24211 transitions. Word has length 54 [2025-04-13 23:26:00,559 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:00,559 INFO L485 AbstractCegarLoop]: Abstraction has 6596 states and 24211 transitions. [2025-04-13 23:26:00,560 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:00,560 INFO L278 IsEmpty]: Start isEmpty. Operand 6596 states and 24211 transitions. [2025-04-13 23:26:00,570 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:00,571 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:00,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:00,571 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2025-04-13 23:26:00,571 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 23:26:00,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:00,571 INFO L85 PathProgramCache]: Analyzing trace with hash 643976399, now seen corresponding path program 114 times [2025-04-13 23:26:00,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:00,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882671183] [2025-04-13 23:26:00,571 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:26:00,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:00,574 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:00,585 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:00,585 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:26:00,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:01,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:01,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:01,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882671183] [2025-04-13 23:26:01,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882671183] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:01,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:01,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:01,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343801263] [2025-04-13 23:26:01,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:01,179 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:01,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:01,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:01,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:01,179 INFO L87 Difference]: Start difference. First operand 6596 states and 24211 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:02,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:02,090 INFO L93 Difference]: Finished difference Result 11461 states and 40655 transitions. [2025-04-13 23:26:02,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:02,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 23:26:02,091 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:02,138 INFO L225 Difference]: With dead ends: 11461 [2025-04-13 23:26:02,138 INFO L226 Difference]: Without dead ends: 11381 [2025-04-13 23:26:02,142 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:26:02,142 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 325 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:02,142 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 120 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:26:02,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11381 states. [2025-04-13 23:26:02,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11381 to 6586. [2025-04-13 23:26:02,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6586 states, 6585 states have (on average 3.6721336370539106) internal successors, (24181), 6585 states have internal predecessors, (24181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:02,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6586 states to 6586 states and 24181 transitions. [2025-04-13 23:26:02,293 INFO L79 Accepts]: Start accepts. Automaton has 6586 states and 24181 transitions. Word has length 54 [2025-04-13 23:26:02,293 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:02,293 INFO L485 AbstractCegarLoop]: Abstraction has 6586 states and 24181 transitions. [2025-04-13 23:26:02,293 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:02,293 INFO L278 IsEmpty]: Start isEmpty. Operand 6586 states and 24181 transitions. [2025-04-13 23:26:02,303 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:02,303 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:02,304 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:02,304 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2025-04-13 23:26:02,304 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 23:26:02,304 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:02,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1420460505, now seen corresponding path program 115 times [2025-04-13 23:26:02,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:02,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148381931] [2025-04-13 23:26:02,304 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:26:02,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:02,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:02,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:02,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:26:02,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:02,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:02,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:02,918 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148381931] [2025-04-13 23:26:02,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148381931] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:02,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:02,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:02,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93173285] [2025-04-13 23:26:02,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:02,918 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:02,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:02,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:02,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:02,919 INFO L87 Difference]: Start difference. First operand 6586 states and 24181 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:03,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:03,896 INFO L93 Difference]: Finished difference Result 12712 states and 45217 transitions. [2025-04-13 23:26:03,896 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:03,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 23:26:03,896 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:03,944 INFO L225 Difference]: With dead ends: 12712 [2025-04-13 23:26:03,944 INFO L226 Difference]: Without dead ends: 12634 [2025-04-13 23:26:03,948 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:26:03,949 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 296 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:03,949 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 112 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1595 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:26:03,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12634 states. [2025-04-13 23:26:04,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12634 to 6576. [2025-04-13 23:26:04,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6576 states, 6575 states have (on average 3.6723954372623573) internal successors, (24146), 6575 states have internal predecessors, (24146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:04,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6576 states to 6576 states and 24146 transitions. [2025-04-13 23:26:04,134 INFO L79 Accepts]: Start accepts. Automaton has 6576 states and 24146 transitions. Word has length 54 [2025-04-13 23:26:04,134 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:04,134 INFO L485 AbstractCegarLoop]: Abstraction has 6576 states and 24146 transitions. [2025-04-13 23:26:04,134 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:04,134 INFO L278 IsEmpty]: Start isEmpty. Operand 6576 states and 24146 transitions. [2025-04-13 23:26:04,145 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:04,145 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:04,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:04,145 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2025-04-13 23:26:04,145 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 23:26:04,146 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:04,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1578860173, now seen corresponding path program 116 times [2025-04-13 23:26:04,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:04,146 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486590466] [2025-04-13 23:26:04,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:26:04,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:04,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:04,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:04,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:26:04,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:04,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 23:26:04,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:04,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486590466] [2025-04-13 23:26:04,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486590466] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:04,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:04,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:04,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235122299] [2025-04-13 23:26:04,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:04,735 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:04,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:04,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:04,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:04,735 INFO L87 Difference]: Start difference. First operand 6576 states and 24146 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:05,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:05,724 INFO L93 Difference]: Finished difference Result 11523 states and 40808 transitions. [2025-04-13 23:26:05,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:05,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 23:26:05,724 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:05,770 INFO L225 Difference]: With dead ends: 11523 [2025-04-13 23:26:05,770 INFO L226 Difference]: Without dead ends: 11452 [2025-04-13 23:26:05,774 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:26:05,774 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 318 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 1714 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:05,775 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 142 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1714 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:26:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11452 states. [2025-04-13 23:26:05,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11452 to 6587. [2025-04-13 23:26:05,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6587 states, 6586 states have (on average 3.6703613726085638) internal successors, (24173), 6586 states have internal predecessors, (24173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:05,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6587 states to 6587 states and 24173 transitions. [2025-04-13 23:26:05,929 INFO L79 Accepts]: Start accepts. Automaton has 6587 states and 24173 transitions. Word has length 54 [2025-04-13 23:26:05,930 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:05,930 INFO L485 AbstractCegarLoop]: Abstraction has 6587 states and 24173 transitions. [2025-04-13 23:26:05,930 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:05,930 INFO L278 IsEmpty]: Start isEmpty. Operand 6587 states and 24173 transitions. [2025-04-13 23:26:05,941 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:05,941 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:05,941 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:05,941 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2025-04-13 23:26:05,941 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 23:26:05,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:05,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1195501083, now seen corresponding path program 117 times [2025-04-13 23:26:05,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:05,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25087114] [2025-04-13 23:26:05,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:26:05,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:05,944 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:05,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:05,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:26:05,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:06,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:06,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25087114] [2025-04-13 23:26:06,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25087114] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:06,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:06,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:06,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117122759] [2025-04-13 23:26:06,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:06,602 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:06,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:06,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:06,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:06,603 INFO L87 Difference]: Start difference. First operand 6587 states and 24173 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:07,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:07,590 INFO L93 Difference]: Finished difference Result 12753 states and 45329 transitions. [2025-04-13 23:26:07,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:26:07,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 23:26:07,591 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:07,638 INFO L225 Difference]: With dead ends: 12753 [2025-04-13 23:26:07,638 INFO L226 Difference]: Without dead ends: 12625 [2025-04-13 23:26:07,643 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:26:07,644 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 290 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:07,644 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 109 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:26:07,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12625 states. [2025-04-13 23:26:07,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12625 to 6567. [2025-04-13 23:26:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6567 states, 6566 states have (on average 3.6708802924154735) internal successors, (24103), 6566 states have internal predecessors, (24103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6567 states to 6567 states and 24103 transitions. [2025-04-13 23:26:07,822 INFO L79 Accepts]: Start accepts. Automaton has 6567 states and 24103 transitions. Word has length 54 [2025-04-13 23:26:07,822 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:07,822 INFO L485 AbstractCegarLoop]: Abstraction has 6567 states and 24103 transitions. [2025-04-13 23:26:07,822 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:07,822 INFO L278 IsEmpty]: Start isEmpty. Operand 6567 states and 24103 transitions. [2025-04-13 23:26:07,834 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:07,834 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:07,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 23:26:07,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2025-04-13 23:26:07,834 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 23:26:07,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:07,834 INFO L85 PathProgramCache]: Analyzing trace with hash 638724847, now seen corresponding path program 118 times [2025-04-13 23:26:07,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:07,834 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712592094] [2025-04-13 23:26:07,834 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:26:07,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:07,837 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:26:07,848 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 23:26:07,848 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:26:07,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:08,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:08,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:08,406 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712592094] [2025-04-13 23:26:08,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712592094] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:08,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:08,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:08,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255505253] [2025-04-13 23:26:08,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:08,407 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:08,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:08,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:08,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:08,407 INFO L87 Difference]: Start difference. First operand 6567 states and 24103 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:09,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:09,244 INFO L93 Difference]: Finished difference Result 11432 states and 40547 transitions. [2025-04-13 23:26:09,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:09,244 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:26:09,244 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:09,287 INFO L225 Difference]: With dead ends: 11432 [2025-04-13 23:26:09,287 INFO L226 Difference]: Without dead ends: 11346 [2025-04-13 23:26:09,292 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:26:09,292 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 279 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1762 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:09,292 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 148 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1762 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:26:09,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11346 states. [2025-04-13 23:26:09,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11346 to 6551. [2025-04-13 23:26:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6551 states, 6550 states have (on average 3.6734351145038167) internal successors, (24061), 6550 states have internal predecessors, (24061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:09,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6551 states to 6551 states and 24061 transitions. [2025-04-13 23:26:09,438 INFO L79 Accepts]: Start accepts. Automaton has 6551 states and 24061 transitions. Word has length 54 [2025-04-13 23:26:09,438 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:09,438 INFO L485 AbstractCegarLoop]: Abstraction has 6551 states and 24061 transitions. [2025-04-13 23:26:09,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:09,439 INFO L278 IsEmpty]: Start isEmpty. Operand 6551 states and 24061 transitions. [2025-04-13 23:26:09,449 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:09,449 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:09,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 23:26:09,450 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2025-04-13 23:26:09,450 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 23:26:09,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:09,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1085012965, now seen corresponding path program 119 times [2025-04-13 23:26:09,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:09,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075133400] [2025-04-13 23:26:09,450 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:26:09,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:09,454 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:09,464 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:09,465 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:26:09,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:10,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:10,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:10,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075133400] [2025-04-13 23:26:10,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075133400] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:10,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:10,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:10,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863060826] [2025-04-13 23:26:10,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:10,051 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:10,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:10,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:10,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:10,052 INFO L87 Difference]: Start difference. First operand 6551 states and 24061 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:10,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:10,939 INFO L93 Difference]: Finished difference Result 12776 states and 45375 transitions. [2025-04-13 23:26:10,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:10,940 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:26:10,940 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:10,983 INFO L225 Difference]: With dead ends: 12776 [2025-04-13 23:26:10,984 INFO L226 Difference]: Without dead ends: 12705 [2025-04-13 23:26:10,988 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 23:26:10,988 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 345 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:10,988 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 97 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:26:11,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12705 states. [2025-04-13 23:26:11,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12705 to 6566. [2025-04-13 23:26:11,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6566 states, 6565 states have (on average 3.671896420411272) internal successors, (24106), 6565 states have internal predecessors, (24106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6566 states to 6566 states and 24106 transitions. [2025-04-13 23:26:11,143 INFO L79 Accepts]: Start accepts. Automaton has 6566 states and 24106 transitions. Word has length 54 [2025-04-13 23:26:11,143 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:11,143 INFO L485 AbstractCegarLoop]: Abstraction has 6566 states and 24106 transitions. [2025-04-13 23:26:11,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 23:26:11,143 INFO L278 IsEmpty]: Start isEmpty. Operand 6566 states and 24106 transitions. [2025-04-13 23:26:11,154 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:11,154 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:11,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 23:26:11,154 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2025-04-13 23:26:11,154 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 23:26:11,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:11,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1250691697, now seen corresponding path program 120 times [2025-04-13 23:26:11,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:11,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69951869] [2025-04-13 23:26:11,155 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:26:11,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:11,158 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:11,168 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:11,168 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:26:11,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:11,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:11,771 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69951869] [2025-04-13 23:26:11,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69951869] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:11,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:11,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:11,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863379991] [2025-04-13 23:26:11,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:11,771 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:11,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:11,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:11,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:11,771 INFO L87 Difference]: Start difference. First operand 6566 states and 24106 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:12,775 INFO L93 Difference]: Finished difference Result 11571 states and 40942 transitions. [2025-04-13 23:26:12,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:12,776 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:26:12,776 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:12,822 INFO L225 Difference]: With dead ends: 11571 [2025-04-13 23:26:12,823 INFO L226 Difference]: Without dead ends: 11454 [2025-04-13 23:26:12,826 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:26:12,826 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 353 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:12,826 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 125 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1545 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:26:12,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11454 states. [2025-04-13 23:26:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11454 to 6588. [2025-04-13 23:26:12,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6588 states, 6587 states have (on average 3.6678305753757403) internal successors, (24160), 6587 states have internal predecessors, (24160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6588 states to 6588 states and 24160 transitions. [2025-04-13 23:26:13,038 INFO L79 Accepts]: Start accepts. Automaton has 6588 states and 24160 transitions. Word has length 54 [2025-04-13 23:26:13,038 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:13,038 INFO L485 AbstractCegarLoop]: Abstraction has 6588 states and 24160 transitions. [2025-04-13 23:26:13,038 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:13,038 INFO L278 IsEmpty]: Start isEmpty. Operand 6588 states and 24160 transitions. [2025-04-13 23:26:13,049 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:13,049 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:13,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 23:26:13,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2025-04-13 23:26:13,049 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 23:26:13,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:13,050 INFO L85 PathProgramCache]: Analyzing trace with hash -285008389, now seen corresponding path program 121 times [2025-04-13 23:26:13,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:13,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256070320] [2025-04-13 23:26:13,050 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:26:13,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:13,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:13,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:13,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:26:13,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:13,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 23:26:13,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:13,695 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256070320] [2025-04-13 23:26:13,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256070320] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:13,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:13,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:13,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772470199] [2025-04-13 23:26:13,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:13,695 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:13,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:13,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:13,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:13,695 INFO L87 Difference]: Start difference. First operand 6588 states and 24160 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:14,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:14,616 INFO L93 Difference]: Finished difference Result 12795 states and 45412 transitions. [2025-04-13 23:26:14,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:14,617 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:26:14,617 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:14,668 INFO L225 Difference]: With dead ends: 12795 [2025-04-13 23:26:14,668 INFO L226 Difference]: Without dead ends: 12717 [2025-04-13 23:26:14,672 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 23:26:14,672 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 309 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:14,672 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 117 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:26:14,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12717 states. [2025-04-13 23:26:14,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12717 to 6578. [2025-04-13 23:26:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6578 states, 6577 states have (on average 3.6688459784096095) internal successors, (24130), 6577 states have internal predecessors, (24130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:14,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6578 states to 6578 states and 24130 transitions. [2025-04-13 23:26:14,825 INFO L79 Accepts]: Start accepts. Automaton has 6578 states and 24130 transitions. Word has length 54 [2025-04-13 23:26:14,826 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:14,826 INFO L485 AbstractCegarLoop]: Abstraction has 6578 states and 24130 transitions. [2025-04-13 23:26:14,826 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:14,826 INFO L278 IsEmpty]: Start isEmpty. Operand 6578 states and 24130 transitions. [2025-04-13 23:26:14,836 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:14,836 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:14,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:14,837 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2025-04-13 23:26:14,837 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 23:26:14,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:14,837 INFO L85 PathProgramCache]: Analyzing trace with hash -184375793, now seen corresponding path program 122 times [2025-04-13 23:26:14,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:14,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834819391] [2025-04-13 23:26:14,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:26:14,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:14,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:14,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:14,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:26:14,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:15,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:15,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:15,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834819391] [2025-04-13 23:26:15,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834819391] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:15,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:15,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:15,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970292985] [2025-04-13 23:26:15,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:15,485 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:15,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:15,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:15,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:15,485 INFO L87 Difference]: Start difference. First operand 6578 states and 24130 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:16,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:16,392 INFO L93 Difference]: Finished difference Result 11525 states and 40792 transitions. [2025-04-13 23:26:16,392 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:16,392 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:26:16,392 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:16,434 INFO L225 Difference]: With dead ends: 11525 [2025-04-13 23:26:16,434 INFO L226 Difference]: Without dead ends: 11454 [2025-04-13 23:26:16,438 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:26:16,438 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 349 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1554 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:16,438 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 123 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1554 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:26:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11454 states. [2025-04-13 23:26:16,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11454 to 6589. [2025-04-13 23:26:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6589 states, 6588 states have (on average 3.6668184578020644) internal successors, (24157), 6588 states have internal predecessors, (24157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:16,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6589 states to 6589 states and 24157 transitions. [2025-04-13 23:26:16,591 INFO L79 Accepts]: Start accepts. Automaton has 6589 states and 24157 transitions. Word has length 54 [2025-04-13 23:26:16,592 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:16,592 INFO L485 AbstractCegarLoop]: Abstraction has 6589 states and 24157 transitions. [2025-04-13 23:26:16,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:16,592 INFO L278 IsEmpty]: Start isEmpty. Operand 6589 states and 24157 transitions. [2025-04-13 23:26:16,604 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:16,604 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:16,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:16,604 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2025-04-13 23:26:16,604 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 23:26:16,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:16,605 INFO L85 PathProgramCache]: Analyzing trace with hash 799973369, now seen corresponding path program 123 times [2025-04-13 23:26:16,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:16,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774225427] [2025-04-13 23:26:16,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:26:16,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:16,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:16,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:16,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:26:16,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:17,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:17,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:17,254 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774225427] [2025-04-13 23:26:17,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774225427] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:17,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:17,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:17,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754962893] [2025-04-13 23:26:17,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:17,254 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:17,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:17,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:17,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:17,255 INFO L87 Difference]: Start difference. First operand 6589 states and 24157 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:18,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:18,114 INFO L93 Difference]: Finished difference Result 12708 states and 45176 transitions. [2025-04-13 23:26:18,114 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:18,114 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:26:18,114 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:18,163 INFO L225 Difference]: With dead ends: 12708 [2025-04-13 23:26:18,163 INFO L226 Difference]: Without dead ends: 12637 [2025-04-13 23:26:18,168 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:26:18,168 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 325 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:18,168 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 85 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:26:18,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12637 states. [2025-04-13 23:26:18,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12637 to 6589. [2025-04-13 23:26:18,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6589 states, 6588 states have (on average 3.6668184578020644) internal successors, (24157), 6588 states have internal predecessors, (24157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:18,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6589 states to 6589 states and 24157 transitions. [2025-04-13 23:26:18,325 INFO L79 Accepts]: Start accepts. Automaton has 6589 states and 24157 transitions. Word has length 54 [2025-04-13 23:26:18,326 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:18,326 INFO L485 AbstractCegarLoop]: Abstraction has 6589 states and 24157 transitions. [2025-04-13 23:26:18,326 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:18,326 INFO L278 IsEmpty]: Start isEmpty. Operand 6589 states and 24157 transitions. [2025-04-13 23:26:18,336 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:18,336 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:18,336 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:18,337 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2025-04-13 23:26:18,337 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 23:26:18,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:18,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1124511119, now seen corresponding path program 124 times [2025-04-13 23:26:18,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:18,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423049634] [2025-04-13 23:26:18,337 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:26:18,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:18,340 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:26:18,349 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 23:26:18,349 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:26:18,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:18,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:18,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423049634] [2025-04-13 23:26:18,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423049634] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:18,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:18,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:18,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871813425] [2025-04-13 23:26:18,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:18,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:18,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:18,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:18,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:18,895 INFO L87 Difference]: Start difference. First operand 6589 states and 24157 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:19,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:19,796 INFO L93 Difference]: Finished difference Result 11465 states and 40628 transitions. [2025-04-13 23:26:19,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:19,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 23:26:19,796 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:19,836 INFO L225 Difference]: With dead ends: 11465 [2025-04-13 23:26:19,836 INFO L226 Difference]: Without dead ends: 11352 [2025-04-13 23:26:19,838 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:26:19,838 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 304 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1786 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:19,838 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 148 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1786 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:26:19,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11352 states. [2025-04-13 23:26:19,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11352 to 6557. [2025-04-13 23:26:19,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6557 states, 6556 states have (on average 3.6711409395973154) internal successors, (24068), 6556 states have internal predecessors, (24068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:19,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6557 states to 6557 states and 24068 transitions. [2025-04-13 23:26:19,970 INFO L79 Accepts]: Start accepts. Automaton has 6557 states and 24068 transitions. Word has length 54 [2025-04-13 23:26:19,970 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:19,970 INFO L485 AbstractCegarLoop]: Abstraction has 6557 states and 24068 transitions. [2025-04-13 23:26:19,970 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:19,970 INFO L278 IsEmpty]: Start isEmpty. Operand 6557 states and 24068 transitions. [2025-04-13 23:26:19,981 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:19,981 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:19,981 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:19,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2025-04-13 23:26:19,981 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 23:26:19,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:19,981 INFO L85 PathProgramCache]: Analyzing trace with hash -140161957, now seen corresponding path program 125 times [2025-04-13 23:26:19,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:19,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27674885] [2025-04-13 23:26:19,981 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:26:19,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:19,984 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:19,994 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:19,994 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:26:19,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:20,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:20,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:20,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27674885] [2025-04-13 23:26:20,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27674885] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:20,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:20,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:20,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264053890] [2025-04-13 23:26:20,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:20,609 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:20,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:20,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:20,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:20,609 INFO L87 Difference]: Start difference. First operand 6557 states and 24068 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:21,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:21,461 INFO L93 Difference]: Finished difference Result 12616 states and 44934 transitions. [2025-04-13 23:26:21,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:21,462 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:26:21,462 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:21,510 INFO L225 Difference]: With dead ends: 12616 [2025-04-13 23:26:21,511 INFO L226 Difference]: Without dead ends: 12535 [2025-04-13 23:26:21,515 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 23:26:21,515 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 287 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:21,515 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 109 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:26:21,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12535 states. [2025-04-13 23:26:21,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12535 to 6546. [2025-04-13 23:26:21,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6546 states, 6545 states have (on average 3.672421695951108) internal successors, (24036), 6545 states have internal predecessors, (24036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:21,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6546 states to 6546 states and 24036 transitions. [2025-04-13 23:26:21,670 INFO L79 Accepts]: Start accepts. Automaton has 6546 states and 24036 transitions. Word has length 54 [2025-04-13 23:26:21,670 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:21,670 INFO L485 AbstractCegarLoop]: Abstraction has 6546 states and 24036 transitions. [2025-04-13 23:26:21,670 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:21,670 INFO L278 IsEmpty]: Start isEmpty. Operand 6546 states and 24036 transitions. [2025-04-13 23:26:21,681 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:21,681 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:21,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:21,681 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2025-04-13 23:26:21,681 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 23:26:21,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:21,681 INFO L85 PathProgramCache]: Analyzing trace with hash 59849069, now seen corresponding path program 126 times [2025-04-13 23:26:21,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:21,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243585040] [2025-04-13 23:26:21,681 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:26:21,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:21,684 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:21,694 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:21,694 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:26:21,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:22,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:22,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:22,259 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243585040] [2025-04-13 23:26:22,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243585040] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:22,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:22,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:22,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107788881] [2025-04-13 23:26:22,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:22,259 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:22,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:22,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:22,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:22,259 INFO L87 Difference]: Start difference. First operand 6546 states and 24036 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:23,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:23,227 INFO L93 Difference]: Finished difference Result 11441 states and 40549 transitions. [2025-04-13 23:26:23,227 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:23,227 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:26:23,228 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:23,272 INFO L225 Difference]: With dead ends: 11441 [2025-04-13 23:26:23,272 INFO L226 Difference]: Without dead ends: 11373 [2025-04-13 23:26:23,276 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:26:23,276 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 318 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:23,276 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 139 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:26:23,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11373 states. [2025-04-13 23:26:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11373 to 6571. [2025-04-13 23:26:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6571 states, 6570 states have (on average 3.671385083713851) internal successors, (24121), 6570 states have internal predecessors, (24121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:23,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6571 states to 6571 states and 24121 transitions. [2025-04-13 23:26:23,420 INFO L79 Accepts]: Start accepts. Automaton has 6571 states and 24121 transitions. Word has length 54 [2025-04-13 23:26:23,421 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:23,421 INFO L485 AbstractCegarLoop]: Abstraction has 6571 states and 24121 transitions. [2025-04-13 23:26:23,421 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:23,421 INFO L278 IsEmpty]: Start isEmpty. Operand 6571 states and 24121 transitions. [2025-04-13 23:26:23,431 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:23,431 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:23,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:23,431 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2025-04-13 23:26:23,431 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 23:26:23,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:23,432 INFO L85 PathProgramCache]: Analyzing trace with hash 635567577, now seen corresponding path program 127 times [2025-04-13 23:26:23,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:23,432 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212558117] [2025-04-13 23:26:23,432 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:26:23,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:23,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:23,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:23,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:26:23,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:24,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:24,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:24,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212558117] [2025-04-13 23:26:24,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212558117] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:24,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:24,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:24,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266994488] [2025-04-13 23:26:24,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:24,075 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:24,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:24,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:24,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:24,075 INFO L87 Difference]: Start difference. First operand 6571 states and 24121 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:25,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:25,085 INFO L93 Difference]: Finished difference Result 12708 states and 45195 transitions. [2025-04-13 23:26:25,086 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:25,086 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:26:25,086 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:25,132 INFO L225 Difference]: With dead ends: 12708 [2025-04-13 23:26:25,133 INFO L226 Difference]: Without dead ends: 12640 [2025-04-13 23:26:25,137 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 23:26:25,138 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 293 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 1646 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:25,138 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 118 Invalid, 1671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1646 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:26:25,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12640 states. [2025-04-13 23:26:25,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12640 to 6581. [2025-04-13 23:26:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6581 states, 6580 states have (on average 3.6696048632218843) internal successors, (24146), 6580 states have internal predecessors, (24146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:25,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6581 states to 6581 states and 24146 transitions. [2025-04-13 23:26:25,305 INFO L79 Accepts]: Start accepts. Automaton has 6581 states and 24146 transitions. Word has length 54 [2025-04-13 23:26:25,306 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:25,306 INFO L485 AbstractCegarLoop]: Abstraction has 6581 states and 24146 transitions. [2025-04-13 23:26:25,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 23:26:25,306 INFO L278 IsEmpty]: Start isEmpty. Operand 6581 states and 24146 transitions. [2025-04-13 23:26:25,317 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:25,317 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:25,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:25,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2025-04-13 23:26:25,317 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 23:26:25,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:25,317 INFO L85 PathProgramCache]: Analyzing trace with hash -740155507, now seen corresponding path program 128 times [2025-04-13 23:26:25,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:25,317 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242888787] [2025-04-13 23:26:25,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:26:25,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:25,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:25,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:25,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:26:25,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:25,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:25,901 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242888787] [2025-04-13 23:26:25,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242888787] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:25,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:25,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:25,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800276369] [2025-04-13 23:26:25,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:25,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:25,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:25,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:25,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:25,901 INFO L87 Difference]: Start difference. First operand 6581 states and 24146 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:26,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:26,879 INFO L93 Difference]: Finished difference Result 11454 states and 40571 transitions. [2025-04-13 23:26:26,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:26,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 23:26:26,879 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:26,922 INFO L225 Difference]: With dead ends: 11454 [2025-04-13 23:26:26,922 INFO L226 Difference]: Without dead ends: 11373 [2025-04-13 23:26:26,926 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:26:26,926 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 308 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:26,926 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 133 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:26:26,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11373 states. [2025-04-13 23:26:27,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11373 to 6571. [2025-04-13 23:26:27,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6571 states, 6570 states have (on average 3.6706240487062405) internal successors, (24116), 6570 states have internal predecessors, (24116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:27,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6571 states to 6571 states and 24116 transitions. [2025-04-13 23:26:27,077 INFO L79 Accepts]: Start accepts. Automaton has 6571 states and 24116 transitions. Word has length 54 [2025-04-13 23:26:27,078 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:27,078 INFO L485 AbstractCegarLoop]: Abstraction has 6571 states and 24116 transitions. [2025-04-13 23:26:27,078 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:27,078 INFO L278 IsEmpty]: Start isEmpty. Operand 6571 states and 24116 transitions. [2025-04-13 23:26:27,089 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:27,089 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:27,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 23:26:27,089 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2025-04-13 23:26:27,089 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 23:26:27,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:27,089 INFO L85 PathProgramCache]: Analyzing trace with hash -134910405, now seen corresponding path program 129 times [2025-04-13 23:26:27,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:27,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910211779] [2025-04-13 23:26:27,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:26:27,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:27,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:27,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:27,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:26:27,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:27,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:27,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:27,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910211779] [2025-04-13 23:26:27,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910211779] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:27,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:27,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:27,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736036006] [2025-04-13 23:26:27,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:27,716 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:27,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:27,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:27,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:27,716 INFO L87 Difference]: Start difference. First operand 6571 states and 24116 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:28,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:28,639 INFO L93 Difference]: Finished difference Result 12630 states and 44982 transitions. [2025-04-13 23:26:28,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:28,639 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:26:28,639 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:28,691 INFO L225 Difference]: With dead ends: 12630 [2025-04-13 23:26:28,691 INFO L226 Difference]: Without dead ends: 12545 [2025-04-13 23:26:28,696 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 23:26:28,696 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 275 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:28,697 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 114 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:26:28,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12545 states. [2025-04-13 23:26:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12545 to 6556. [2025-04-13 23:26:28,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6556 states, 6555 states have (on average 3.672921434019832) internal successors, (24076), 6555 states have internal predecessors, (24076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:28,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6556 states to 6556 states and 24076 transitions. [2025-04-13 23:26:28,911 INFO L79 Accepts]: Start accepts. Automaton has 6556 states and 24076 transitions. Word has length 54 [2025-04-13 23:26:28,911 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:28,911 INFO L485 AbstractCegarLoop]: Abstraction has 6556 states and 24076 transitions. [2025-04-13 23:26:28,911 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:28,911 INFO L278 IsEmpty]: Start isEmpty. Operand 6556 states and 24076 transitions. [2025-04-13 23:26:28,922 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:28,922 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:28,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 23:26:28,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2025-04-13 23:26:28,922 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 23:26:28,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:28,923 INFO L85 PathProgramCache]: Analyzing trace with hash 980425035, now seen corresponding path program 130 times [2025-04-13 23:26:28,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:28,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992677971] [2025-04-13 23:26:28,923 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:26:28,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:28,926 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:26:28,937 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 23:26:28,937 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:26:28,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:29,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:29,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:29,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992677971] [2025-04-13 23:26:29,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992677971] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:29,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:29,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:29,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554023959] [2025-04-13 23:26:29,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:29,473 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:29,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:29,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:29,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:29,474 INFO L87 Difference]: Start difference. First operand 6556 states and 24076 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:30,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:30,336 INFO L93 Difference]: Finished difference Result 11506 states and 40707 transitions. [2025-04-13 23:26:30,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:30,336 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:26:30,336 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:30,381 INFO L225 Difference]: With dead ends: 11506 [2025-04-13 23:26:30,381 INFO L226 Difference]: Without dead ends: 11438 [2025-04-13 23:26:30,385 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:26:30,385 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 334 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 1678 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:30,385 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 139 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1678 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:26:30,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11438 states. [2025-04-13 23:26:30,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11438 to 6566. [2025-04-13 23:26:30,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6566 states, 6565 states have (on average 3.671134805788271) internal successors, (24101), 6565 states have internal predecessors, (24101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:30,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6566 states to 6566 states and 24101 transitions. [2025-04-13 23:26:30,532 INFO L79 Accepts]: Start accepts. Automaton has 6566 states and 24101 transitions. Word has length 54 [2025-04-13 23:26:30,533 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:30,533 INFO L485 AbstractCegarLoop]: Abstraction has 6566 states and 24101 transitions. [2025-04-13 23:26:30,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 23:26:30,533 INFO L278 IsEmpty]: Start isEmpty. Operand 6566 states and 24101 transitions. [2025-04-13 23:26:30,543 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:30,543 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:30,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:30,543 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2025-04-13 23:26:30,544 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 23:26:30,544 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:30,544 INFO L85 PathProgramCache]: Analyzing trace with hash -331415043, now seen corresponding path program 131 times [2025-04-13 23:26:30,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:30,544 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889884782] [2025-04-13 23:26:30,544 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:26:30,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:30,547 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:30,557 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:30,557 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:26:30,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:31,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:31,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889884782] [2025-04-13 23:26:31,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889884782] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:31,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:31,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:31,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238623551] [2025-04-13 23:26:31,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:31,182 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:31,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:31,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:31,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:31,182 INFO L87 Difference]: Start difference. First operand 6566 states and 24101 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:32,127 INFO L93 Difference]: Finished difference Result 12591 states and 44862 transitions. [2025-04-13 23:26:32,128 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:32,128 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:26:32,128 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:32,177 INFO L225 Difference]: With dead ends: 12591 [2025-04-13 23:26:32,177 INFO L226 Difference]: Without dead ends: 12483 [2025-04-13 23:26:32,182 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:26:32,182 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 264 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 109 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.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:32,182 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 109 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:26:32,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12483 states. [2025-04-13 23:26:32,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12483 to 6586. [2025-04-13 23:26:32,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6586 states, 6585 states have (on average 3.667577828397874) internal successors, (24151), 6585 states have internal predecessors, (24151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6586 states to 6586 states and 24151 transitions. [2025-04-13 23:26:32,348 INFO L79 Accepts]: Start accepts. Automaton has 6586 states and 24151 transitions. Word has length 54 [2025-04-13 23:26:32,348 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:32,348 INFO L485 AbstractCegarLoop]: Abstraction has 6586 states and 24151 transitions. [2025-04-13 23:26:32,348 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:32,348 INFO L278 IsEmpty]: Start isEmpty. Operand 6586 states and 24151 transitions. [2025-04-13 23:26:32,359 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:32,359 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:32,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:32,359 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2025-04-13 23:26:32,359 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 23:26:32,359 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:32,360 INFO L85 PathProgramCache]: Analyzing trace with hash 209947053, now seen corresponding path program 132 times [2025-04-13 23:26:32,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:32,360 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726180123] [2025-04-13 23:26:32,360 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:26:32,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:32,362 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:32,373 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:32,373 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:26:32,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:33,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 23:26:33,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:33,008 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726180123] [2025-04-13 23:26:33,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726180123] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:33,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:33,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:33,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120647215] [2025-04-13 23:26:33,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:33,009 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:33,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:33,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:33,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:33,009 INFO L87 Difference]: Start difference. First operand 6586 states and 24151 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:33,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:33,950 INFO L93 Difference]: Finished difference Result 11480 states and 40639 transitions. [2025-04-13 23:26:33,950 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:33,950 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:26:33,950 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:33,994 INFO L225 Difference]: With dead ends: 11480 [2025-04-13 23:26:33,995 INFO L226 Difference]: Without dead ends: 11400 [2025-04-13 23:26:33,998 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:26:33,999 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 363 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1585 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:33,999 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 128 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1585 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:26:34,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11400 states. [2025-04-13 23:26:34,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11400 to 6576. [2025-04-13 23:26:34,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6576 states, 6575 states have (on average 3.6685931558935363) internal successors, (24121), 6575 states have internal predecessors, (24121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6576 states to 6576 states and 24121 transitions. [2025-04-13 23:26:34,152 INFO L79 Accepts]: Start accepts. Automaton has 6576 states and 24121 transitions. Word has length 54 [2025-04-13 23:26:34,152 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:34,152 INFO L485 AbstractCegarLoop]: Abstraction has 6576 states and 24121 transitions. [2025-04-13 23:26:34,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 23:26:34,152 INFO L278 IsEmpty]: Start isEmpty. Operand 6576 states and 24121 transitions. [2025-04-13 23:26:34,163 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:34,163 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:34,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:34,163 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2025-04-13 23:26:34,163 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 23:26:34,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:34,163 INFO L85 PathProgramCache]: Analyzing trace with hash -802072165, now seen corresponding path program 133 times [2025-04-13 23:26:34,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:34,164 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760546637] [2025-04-13 23:26:34,164 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:26:34,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:34,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:34,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:34,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:26:34,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:34,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 23:26:34,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:34,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760546637] [2025-04-13 23:26:34,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760546637] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:34,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:34,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:34,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015218129] [2025-04-13 23:26:34,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:34,827 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:34,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:34,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:34,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:34,827 INFO L87 Difference]: Start difference. First operand 6576 states and 24121 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:35,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:35,799 INFO L93 Difference]: Finished difference Result 12553 states and 44732 transitions. [2025-04-13 23:26:35,800 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:26:35,800 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:26:35,800 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:35,844 INFO L225 Difference]: With dead ends: 12553 [2025-04-13 23:26:35,844 INFO L226 Difference]: Without dead ends: 12485 [2025-04-13 23:26:35,849 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:26:35,849 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 266 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:35,849 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 107 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:26:35,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12485 states. [2025-04-13 23:26:35,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12485 to 6586. [2025-04-13 23:26:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6586 states, 6585 states have (on average 3.6668185269552014) internal successors, (24146), 6585 states have internal predecessors, (24146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6586 states to 6586 states and 24146 transitions. [2025-04-13 23:26:35,997 INFO L79 Accepts]: Start accepts. Automaton has 6586 states and 24146 transitions. Word has length 54 [2025-04-13 23:26:35,997 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:35,997 INFO L485 AbstractCegarLoop]: Abstraction has 6586 states and 24146 transitions. [2025-04-13 23:26:35,997 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:35,998 INFO L278 IsEmpty]: Start isEmpty. Operand 6586 states and 24146 transitions. [2025-04-13 23:26:36,008 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:36,008 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:36,008 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:36,008 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2025-04-13 23:26:36,008 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 23:26:36,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:36,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1144830827, now seen corresponding path program 134 times [2025-04-13 23:26:36,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:36,009 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667082551] [2025-04-13 23:26:36,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:26:36,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:36,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:36,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:36,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:26:36,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:36,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 23:26:36,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:36,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667082551] [2025-04-13 23:26:36,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667082551] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:36,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:36,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:36,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463139835] [2025-04-13 23:26:36,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:36,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:36,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:36,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:36,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:36,647 INFO L87 Difference]: Start difference. First operand 6586 states and 24146 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:37,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:37,623 INFO L93 Difference]: Finished difference Result 11540 states and 40787 transitions. [2025-04-13 23:26:37,623 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:37,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 23:26:37,623 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:37,668 INFO L225 Difference]: With dead ends: 11540 [2025-04-13 23:26:37,668 INFO L226 Difference]: Without dead ends: 11469 [2025-04-13 23:26:37,672 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:26:37,672 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 319 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:37,672 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 144 Invalid, 1753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:26:37,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11469 states. [2025-04-13 23:26:37,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11469 to 6597. [2025-04-13 23:26:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6597 states, 6596 states have (on average 3.664796846573681) internal successors, (24173), 6596 states have internal predecessors, (24173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:37,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6597 states to 6597 states and 24173 transitions. [2025-04-13 23:26:37,853 INFO L79 Accepts]: Start accepts. Automaton has 6597 states and 24173 transitions. Word has length 54 [2025-04-13 23:26:37,853 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:37,854 INFO L485 AbstractCegarLoop]: Abstraction has 6597 states and 24173 transitions. [2025-04-13 23:26:37,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 23:26:37,854 INFO L278 IsEmpty]: Start isEmpty. Operand 6597 states and 24173 transitions. [2025-04-13 23:26:37,864 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:37,864 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:37,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:37,864 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2025-04-13 23:26:37,864 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 23:26:37,865 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:37,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1572550147, now seen corresponding path program 135 times [2025-04-13 23:26:37,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:37,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749139253] [2025-04-13 23:26:37,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:26:37,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:37,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:37,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:37,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:26:37,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:38,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:38,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:38,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749139253] [2025-04-13 23:26:38,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749139253] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:38,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:38,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:38,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859872697] [2025-04-13 23:26:38,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:38,512 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:38,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:38,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:38,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:38,512 INFO L87 Difference]: Start difference. First operand 6597 states and 24173 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:39,457 INFO L93 Difference]: Finished difference Result 12496 states and 44576 transitions. [2025-04-13 23:26:39,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:39,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 23:26:39,457 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:39,506 INFO L225 Difference]: With dead ends: 12496 [2025-04-13 23:26:39,506 INFO L226 Difference]: Without dead ends: 12366 [2025-04-13 23:26:39,511 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 23:26:39,511 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 239 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:39,511 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 123 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:26:39,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12366 states. [2025-04-13 23:26:39,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12366 to 6537. [2025-04-13 23:26:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6537 states, 6536 states have (on average 3.6724296205630353) internal successors, (24003), 6536 states have internal predecessors, (24003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:39,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6537 states to 6537 states and 24003 transitions. [2025-04-13 23:26:39,669 INFO L79 Accepts]: Start accepts. Automaton has 6537 states and 24003 transitions. Word has length 54 [2025-04-13 23:26:39,669 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:39,669 INFO L485 AbstractCegarLoop]: Abstraction has 6537 states and 24003 transitions. [2025-04-13 23:26:39,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:39,669 INFO L278 IsEmpty]: Start isEmpty. Operand 6537 states and 24003 transitions. [2025-04-13 23:26:39,680 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:39,680 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:39,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:39,680 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2025-04-13 23:26:39,680 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 23:26:39,680 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:39,680 INFO L85 PathProgramCache]: Analyzing trace with hash 204695501, now seen corresponding path program 136 times [2025-04-13 23:26:39,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:39,680 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660129107] [2025-04-13 23:26:39,680 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:26:39,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:39,683 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:26:39,694 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 23:26:39,694 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:26:39,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:40,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:40,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:40,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660129107] [2025-04-13 23:26:40,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660129107] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:40,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:40,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:40,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970407273] [2025-04-13 23:26:40,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:40,271 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:40,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:40,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:40,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:40,272 INFO L87 Difference]: Start difference. First operand 6537 states and 24003 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:41,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:41,076 INFO L93 Difference]: Finished difference Result 11431 states and 40491 transitions. [2025-04-13 23:26:41,076 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:41,076 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:26:41,077 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:41,120 INFO L225 Difference]: With dead ends: 11431 [2025-04-13 23:26:41,120 INFO L226 Difference]: Without dead ends: 11345 [2025-04-13 23:26:41,125 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:26:41,125 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 307 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1645 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:41,125 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 136 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1645 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:26:41,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11345 states. [2025-04-13 23:26:41,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11345 to 6521. [2025-04-13 23:26:41,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6521 states, 6520 states have (on average 3.675) internal successors, (23961), 6520 states have internal predecessors, (23961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6521 states to 6521 states and 23961 transitions. [2025-04-13 23:26:41,298 INFO L79 Accepts]: Start accepts. Automaton has 6521 states and 23961 transitions. Word has length 54 [2025-04-13 23:26:41,298 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:41,298 INFO L485 AbstractCegarLoop]: Abstraction has 6521 states and 23961 transitions. [2025-04-13 23:26:41,298 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:41,298 INFO L278 IsEmpty]: Start isEmpty. Operand 6521 states and 23961 transitions. [2025-04-13 23:26:41,309 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:41,309 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:41,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:41,310 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2025-04-13 23:26:41,310 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 23:26:41,310 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:41,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1595428571, now seen corresponding path program 137 times [2025-04-13 23:26:41,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:41,310 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707030257] [2025-04-13 23:26:41,310 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:26:41,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:41,313 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:41,324 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:41,324 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:26:41,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:41,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:41,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:41,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707030257] [2025-04-13 23:26:41,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707030257] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:41,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:41,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:41,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753852673] [2025-04-13 23:26:41,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:41,933 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:41,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:41,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:41,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:41,933 INFO L87 Difference]: Start difference. First operand 6521 states and 23961 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:42,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:42,825 INFO L93 Difference]: Finished difference Result 12865 states and 45734 transitions. [2025-04-13 23:26:42,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:42,826 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:26:42,826 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:42,874 INFO L225 Difference]: With dead ends: 12865 [2025-04-13 23:26:42,874 INFO L226 Difference]: Without dead ends: 12794 [2025-04-13 23:26:42,879 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 23:26:42,879 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 307 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:42,879 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 101 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:26:42,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12794 states. [2025-04-13 23:26:42,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12794 to 6596. [2025-04-13 23:26:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6596 states, 6595 states have (on average 3.67338893100834) internal successors, (24226), 6595 states have internal predecessors, (24226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:43,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6596 states to 6596 states and 24226 transitions. [2025-04-13 23:26:43,038 INFO L79 Accepts]: Start accepts. Automaton has 6596 states and 24226 transitions. Word has length 54 [2025-04-13 23:26:43,038 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:43,038 INFO L485 AbstractCegarLoop]: Abstraction has 6596 states and 24226 transitions. [2025-04-13 23:26:43,038 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:43,038 INFO L278 IsEmpty]: Start isEmpty. Operand 6596 states and 24226 transitions. [2025-04-13 23:26:43,049 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:43,049 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:43,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 23:26:43,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2025-04-13 23:26:43,049 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 23:26:43,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:43,049 INFO L85 PathProgramCache]: Analyzing trace with hash -538613763, now seen corresponding path program 138 times [2025-04-13 23:26:43,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:43,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672543345] [2025-04-13 23:26:43,049 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:26:43,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:43,052 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:43,062 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:43,062 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:26:43,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:43,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:43,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672543345] [2025-04-13 23:26:43,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672543345] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:43,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:43,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:43,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663832038] [2025-04-13 23:26:43,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:43,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:43,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:43,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:43,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:43,709 INFO L87 Difference]: Start difference. First operand 6596 states and 24226 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:44,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:44,783 INFO L93 Difference]: Finished difference Result 11364 states and 40366 transitions. [2025-04-13 23:26:44,783 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:26:44,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 23:26:44,783 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:44,827 INFO L225 Difference]: With dead ends: 11364 [2025-04-13 23:26:44,827 INFO L226 Difference]: Without dead ends: 11296 [2025-04-13 23:26:44,831 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:26:44,831 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 288 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 1960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:44,831 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 164 Invalid, 1960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:26:44,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11296 states. [2025-04-13 23:26:44,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11296 to 6626. [2025-04-13 23:26:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6626 states, 6625 states have (on average 3.6710943396226416) internal successors, (24321), 6625 states have internal predecessors, (24321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6626 states to 6626 states and 24321 transitions. [2025-04-13 23:26:44,984 INFO L79 Accepts]: Start accepts. Automaton has 6626 states and 24321 transitions. Word has length 54 [2025-04-13 23:26:44,984 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:44,984 INFO L485 AbstractCegarLoop]: Abstraction has 6626 states and 24321 transitions. [2025-04-13 23:26:44,984 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:44,984 INFO L278 IsEmpty]: Start isEmpty. Operand 6626 states and 24321 transitions. [2025-04-13 23:26:44,995 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:44,995 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:44,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 23:26:44,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2025-04-13 23:26:44,995 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 23:26:44,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:44,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1899534149, now seen corresponding path program 139 times [2025-04-13 23:26:44,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:44,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251501818] [2025-04-13 23:26:44,996 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:26:44,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:44,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:45,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:45,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:26:45,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:45,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:45,612 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251501818] [2025-04-13 23:26:45,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251501818] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:45,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:45,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:45,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076906318] [2025-04-13 23:26:45,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:45,612 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:45,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:45,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:45,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:45,612 INFO L87 Difference]: Start difference. First operand 6626 states and 24321 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:46,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:46,496 INFO L93 Difference]: Finished difference Result 12824 states and 45639 transitions. [2025-04-13 23:26:46,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:46,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 23:26:46,497 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:46,545 INFO L225 Difference]: With dead ends: 12824 [2025-04-13 23:26:46,545 INFO L226 Difference]: Without dead ends: 12746 [2025-04-13 23:26:46,549 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 23:26:46,550 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 306 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 105 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 23:26:46,550 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 105 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:26:46,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12746 states. [2025-04-13 23:26:46,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12746 to 6616. [2025-04-13 23:26:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6616 states, 6615 states have (on average 3.6713529856386997) internal successors, (24286), 6615 states have internal predecessors, (24286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:46,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6616 states to 6616 states and 24286 transitions. [2025-04-13 23:26:46,734 INFO L79 Accepts]: Start accepts. Automaton has 6616 states and 24286 transitions. Word has length 54 [2025-04-13 23:26:46,735 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:46,735 INFO L485 AbstractCegarLoop]: Abstraction has 6616 states and 24286 transitions. [2025-04-13 23:26:46,735 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:46,735 INFO L278 IsEmpty]: Start isEmpty. Operand 6616 states and 24286 transitions. [2025-04-13 23:26:46,745 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:46,745 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:46,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:46,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2025-04-13 23:26:46,745 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 23:26:46,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:46,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1309091745, now seen corresponding path program 140 times [2025-04-13 23:26:46,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:46,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287660300] [2025-04-13 23:26:46,746 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:26:46,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:46,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:46,758 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:46,758 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:26:46,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:47,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:47,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:47,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287660300] [2025-04-13 23:26:47,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287660300] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:47,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:47,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:47,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499341803] [2025-04-13 23:26:47,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:47,360 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:47,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:47,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:47,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:47,360 INFO L87 Difference]: Start difference. First operand 6616 states and 24286 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:48,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:48,385 INFO L93 Difference]: Finished difference Result 11356 states and 40326 transitions. [2025-04-13 23:26:48,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:48,385 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:26:48,385 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:48,429 INFO L225 Difference]: With dead ends: 11356 [2025-04-13 23:26:48,430 INFO L226 Difference]: Without dead ends: 11276 [2025-04-13 23:26:48,434 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:26:48,434 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 310 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 1883 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:48,434 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 156 Invalid, 1899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1883 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:26:48,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11276 states. [2025-04-13 23:26:48,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11276 to 6606. [2025-04-13 23:26:48,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6606 states, 6605 states have (on average 3.6716124148372447) internal successors, (24251), 6605 states have internal predecessors, (24251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:48,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6606 states to 6606 states and 24251 transitions. [2025-04-13 23:26:48,587 INFO L79 Accepts]: Start accepts. Automaton has 6606 states and 24251 transitions. Word has length 54 [2025-04-13 23:26:48,588 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:48,588 INFO L485 AbstractCegarLoop]: Abstraction has 6606 states and 24251 transitions. [2025-04-13 23:26:48,588 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:48,588 INFO L278 IsEmpty]: Start isEmpty. Operand 6606 states and 24251 transitions. [2025-04-13 23:26:48,598 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:48,599 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:48,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:48,599 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2025-04-13 23:26:48,599 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 23:26:48,599 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:48,599 INFO L85 PathProgramCache]: Analyzing trace with hash -985174307, now seen corresponding path program 141 times [2025-04-13 23:26:48,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:48,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352508851] [2025-04-13 23:26:48,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:26:48,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:48,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:48,613 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:48,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:26:48,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:49,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:49,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:49,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352508851] [2025-04-13 23:26:49,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352508851] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:49,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:49,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:49,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107339512] [2025-04-13 23:26:49,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:49,229 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:49,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:49,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:49,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:49,229 INFO L87 Difference]: Start difference. First operand 6606 states and 24251 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:50,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:50,163 INFO L93 Difference]: Finished difference Result 12853 states and 45710 transitions. [2025-04-13 23:26:50,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:50,163 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:26:50,163 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:50,210 INFO L225 Difference]: With dead ends: 12853 [2025-04-13 23:26:50,210 INFO L226 Difference]: Without dead ends: 12716 [2025-04-13 23:26:50,215 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 23:26:50,215 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 286 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:50,215 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 111 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:26:50,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12716 states. [2025-04-13 23:26:50,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12716 to 6586. [2025-04-13 23:26:50,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6586 states, 6585 states have (on average 3.6721336370539106) internal successors, (24181), 6585 states have internal predecessors, (24181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6586 states to 6586 states and 24181 transitions. [2025-04-13 23:26:50,377 INFO L79 Accepts]: Start accepts. Automaton has 6586 states and 24181 transitions. Word has length 54 [2025-04-13 23:26:50,377 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:50,377 INFO L485 AbstractCegarLoop]: Abstraction has 6586 states and 24181 transitions. [2025-04-13 23:26:50,377 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:50,377 INFO L278 IsEmpty]: Start isEmpty. Operand 6586 states and 24181 transitions. [2025-04-13 23:26:50,388 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:50,388 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:50,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 23:26:50,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2025-04-13 23:26:50,388 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 23:26:50,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:50,389 INFO L85 PathProgramCache]: Analyzing trace with hash 299223437, now seen corresponding path program 142 times [2025-04-13 23:26:50,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:50,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034726917] [2025-04-13 23:26:50,389 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:26:50,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:50,391 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:26:50,404 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 23:26:50,404 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:26:50,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:50,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 23:26:50,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:50,988 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034726917] [2025-04-13 23:26:50,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034726917] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:50,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:50,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:50,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755486390] [2025-04-13 23:26:50,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:50,989 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:50,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:50,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:50,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:50,989 INFO L87 Difference]: Start difference. First operand 6586 states and 24181 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:51,860 INFO L93 Difference]: Finished difference Result 11348 states and 40286 transitions. [2025-04-13 23:26:51,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:51,861 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:26:51,861 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:51,901 INFO L225 Difference]: With dead ends: 11348 [2025-04-13 23:26:51,901 INFO L226 Difference]: Without dead ends: 11214 [2025-04-13 23:26:51,905 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:26:51,906 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 280 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 1787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:51,906 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 145 Invalid, 1787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1770 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:26:51,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11214 states. [2025-04-13 23:26:52,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11214 to 6566. [2025-04-13 23:26:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6566 states, 6565 states have (on average 3.6726580350342726) internal successors, (24111), 6565 states have internal predecessors, (24111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6566 states to 6566 states and 24111 transitions. [2025-04-13 23:26:52,053 INFO L79 Accepts]: Start accepts. Automaton has 6566 states and 24111 transitions. Word has length 54 [2025-04-13 23:26:52,053 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:52,053 INFO L485 AbstractCegarLoop]: Abstraction has 6566 states and 24111 transitions. [2025-04-13 23:26:52,053 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:52,053 INFO L278 IsEmpty]: Start isEmpty. Operand 6566 states and 24111 transitions. [2025-04-13 23:26:52,064 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:52,064 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:52,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:52,064 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2025-04-13 23:26:52,064 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 23:26:52,064 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:52,064 INFO L85 PathProgramCache]: Analyzing trace with hash 58009341, now seen corresponding path program 143 times [2025-04-13 23:26:52,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:52,064 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432621556] [2025-04-13 23:26:52,065 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:26:52,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:52,067 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:52,077 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:52,077 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:26:52,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:52,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 23:26:52,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:52,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432621556] [2025-04-13 23:26:52,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432621556] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:52,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:52,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:52,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002830735] [2025-04-13 23:26:52,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:52,726 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:52,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:52,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:52,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:52,726 INFO L87 Difference]: Start difference. First operand 6566 states and 24111 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:53,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:53,688 INFO L93 Difference]: Finished difference Result 12964 states and 45982 transitions. [2025-04-13 23:26:53,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:53,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 23:26:53,688 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:53,737 INFO L225 Difference]: With dead ends: 12964 [2025-04-13 23:26:53,738 INFO L226 Difference]: Without dead ends: 12893 [2025-04-13 23:26:53,742 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 23:26:53,743 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 302 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1576 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:53,743 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 108 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1576 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:26:53,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12893 states. [2025-04-13 23:26:53,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12893 to 6581. [2025-04-13 23:26:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6581 states, 6580 states have (on average 3.67112462006079) internal successors, (24156), 6580 states have internal predecessors, (24156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6581 states to 6581 states and 24156 transitions. [2025-04-13 23:26:53,918 INFO L79 Accepts]: Start accepts. Automaton has 6581 states and 24156 transitions. Word has length 54 [2025-04-13 23:26:53,918 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:53,918 INFO L485 AbstractCegarLoop]: Abstraction has 6581 states and 24156 transitions. [2025-04-13 23:26:53,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 23:26:53,918 INFO L278 IsEmpty]: Start isEmpty. Operand 6581 states and 24156 transitions. [2025-04-13 23:26:53,929 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:53,929 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:53,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 23:26:53,929 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2025-04-13 23:26:53,929 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 23:26:53,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:53,929 INFO L85 PathProgramCache]: Analyzing trace with hash -537006083, now seen corresponding path program 144 times [2025-04-13 23:26:53,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:53,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685978027] [2025-04-13 23:26:53,929 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:26:53,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:53,932 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:53,941 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:53,941 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:26:53,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:54,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 23:26:54,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:54,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685978027] [2025-04-13 23:26:54,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685978027] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:54,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:54,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:54,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383887242] [2025-04-13 23:26:54,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:54,512 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:54,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:54,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:54,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:54,513 INFO L87 Difference]: Start difference. First operand 6581 states and 24156 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:55,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:55,490 INFO L93 Difference]: Finished difference Result 11470 states and 40622 transitions. [2025-04-13 23:26:55,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:55,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 23:26:55,490 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:55,581 INFO L225 Difference]: With dead ends: 11470 [2025-04-13 23:26:55,581 INFO L226 Difference]: Without dead ends: 11399 [2025-04-13 23:26:55,583 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:26:55,583 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 291 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:55,583 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 150 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:26:55,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11399 states. [2025-04-13 23:26:55,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11399 to 6614. [2025-04-13 23:26:55,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6614 states, 6613 states have (on average 3.6683804627249357) internal successors, (24259), 6613 states have internal predecessors, (24259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:55,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6614 states to 6614 states and 24259 transitions. [2025-04-13 23:26:55,725 INFO L79 Accepts]: Start accepts. Automaton has 6614 states and 24259 transitions. Word has length 54 [2025-04-13 23:26:55,725 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:55,725 INFO L485 AbstractCegarLoop]: Abstraction has 6614 states and 24259 transitions. [2025-04-13 23:26:55,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 23:26:55,726 INFO L278 IsEmpty]: Start isEmpty. Operand 6614 states and 24259 transitions. [2025-04-13 23:26:55,737 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:55,737 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:55,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:55,737 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2025-04-13 23:26:55,737 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 23:26:55,738 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:55,738 INFO L85 PathProgramCache]: Analyzing trace with hash 858013917, now seen corresponding path program 145 times [2025-04-13 23:26:55,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:55,738 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150013683] [2025-04-13 23:26:55,738 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:26:55,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:55,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:55,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:55,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:26:55,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:56,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:26:56,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:56,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150013683] [2025-04-13 23:26:56,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150013683] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:56,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:56,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:56,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560031947] [2025-04-13 23:26:56,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:56,367 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:56,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:56,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:56,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:56,367 INFO L87 Difference]: Start difference. First operand 6614 states and 24259 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:57,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:57,361 INFO L93 Difference]: Finished difference Result 12994 states and 46068 transitions. [2025-04-13 23:26:57,361 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:57,361 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:26:57,362 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:57,412 INFO L225 Difference]: With dead ends: 12994 [2025-04-13 23:26:57,412 INFO L226 Difference]: Without dead ends: 12916 [2025-04-13 23:26:57,416 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 23:26:57,417 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 309 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:57,417 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 122 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1659 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:26:57,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12916 states. [2025-04-13 23:26:57,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12916 to 6604. [2025-04-13 23:26:57,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6604 states, 6603 states have (on average 3.669392700287748) internal successors, (24229), 6603 states have internal predecessors, (24229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:57,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6604 states to 6604 states and 24229 transitions. [2025-04-13 23:26:57,575 INFO L79 Accepts]: Start accepts. Automaton has 6604 states and 24229 transitions. Word has length 54 [2025-04-13 23:26:57,575 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:57,575 INFO L485 AbstractCegarLoop]: Abstraction has 6604 states and 24229 transitions. [2025-04-13 23:26:57,575 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:57,575 INFO L278 IsEmpty]: Start isEmpty. Operand 6604 states and 24229 transitions. [2025-04-13 23:26:57,586 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:57,586 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:57,587 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:57,587 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2025-04-13 23:26:57,587 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 23:26:57,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:57,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1477141409, now seen corresponding path program 146 times [2025-04-13 23:26:57,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:57,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052537369] [2025-04-13 23:26:57,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:26:57,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:57,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:57,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:57,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:26:57,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:26:58,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 23:26:58,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:26:58,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052537369] [2025-04-13 23:26:58,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052537369] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:26:58,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:26:58,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:26:58,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052565435] [2025-04-13 23:26:58,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:26:58,216 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:26:58,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:26:58,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:26:58,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:26:58,216 INFO L87 Difference]: Start difference. First operand 6604 states and 24229 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:26:59,350 INFO L93 Difference]: Finished difference Result 11459 states and 40579 transitions. [2025-04-13 23:26:59,350 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:26:59,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 23:26:59,350 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:26:59,394 INFO L225 Difference]: With dead ends: 11459 [2025-04-13 23:26:59,394 INFO L226 Difference]: Without dead ends: 11378 [2025-04-13 23:26:59,399 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:26:59,399 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 282 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:26:59,399 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 144 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1747 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:26:59,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11378 states. [2025-04-13 23:26:59,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11378 to 6593. [2025-04-13 23:26:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6593 states, 6592 states have (on average 3.669751213592233) internal successors, (24191), 6592 states have internal predecessors, (24191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:59,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6593 states to 6593 states and 24191 transitions. [2025-04-13 23:26:59,556 INFO L79 Accepts]: Start accepts. Automaton has 6593 states and 24191 transitions. Word has length 54 [2025-04-13 23:26:59,556 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:26:59,556 INFO L485 AbstractCegarLoop]: Abstraction has 6593 states and 24191 transitions. [2025-04-13 23:26:59,556 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:26:59,556 INFO L278 IsEmpty]: Start isEmpty. Operand 6593 states and 24191 transitions. [2025-04-13 23:26:59,567 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:26:59,567 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:26:59,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:26:59,567 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2025-04-13 23:26:59,567 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 23:26:59,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:26:59,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1942995675, now seen corresponding path program 147 times [2025-04-13 23:26:59,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:26:59,567 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882243370] [2025-04-13 23:26:59,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:26:59,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:26:59,570 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:26:59,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:26:59,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:26:59,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:00,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:00,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882243370] [2025-04-13 23:27:00,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882243370] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:00,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:00,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:00,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174766137] [2025-04-13 23:27:00,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:00,222 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:00,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:00,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:00,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:00,223 INFO L87 Difference]: Start difference. First operand 6593 states and 24191 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:01,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:01,141 INFO L93 Difference]: Finished difference Result 12986 states and 46043 transitions. [2025-04-13 23:27:01,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:01,141 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:27:01,142 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:01,190 INFO L225 Difference]: With dead ends: 12986 [2025-04-13 23:27:01,190 INFO L226 Difference]: Without dead ends: 12915 [2025-04-13 23:27:01,195 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 23:27:01,195 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 347 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:01,195 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 97 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:27:01,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12915 states. [2025-04-13 23:27:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12915 to 6604. [2025-04-13 23:27:01,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6604 states, 6603 states have (on average 3.6677267908526425) internal successors, (24218), 6603 states have internal predecessors, (24218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6604 states to 6604 states and 24218 transitions. [2025-04-13 23:27:01,358 INFO L79 Accepts]: Start accepts. Automaton has 6604 states and 24218 transitions. Word has length 54 [2025-04-13 23:27:01,358 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:01,358 INFO L485 AbstractCegarLoop]: Abstraction has 6604 states and 24218 transitions. [2025-04-13 23:27:01,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 23:27:01,358 INFO L278 IsEmpty]: Start isEmpty. Operand 6604 states and 24218 transitions. [2025-04-13 23:27:01,369 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:01,369 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:01,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:01,369 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2025-04-13 23:27:01,369 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 23:27:01,369 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:01,369 INFO L85 PathProgramCache]: Analyzing trace with hash 136425325, now seen corresponding path program 148 times [2025-04-13 23:27:01,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:01,369 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208308300] [2025-04-13 23:27:01,369 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:27:01,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:01,372 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:27:01,383 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 23:27:01,383 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:27:01,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:01,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:01,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208308300] [2025-04-13 23:27:01,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208308300] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:01,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:01,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:01,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230333261] [2025-04-13 23:27:01,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:01,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:01,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:01,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:01,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:01,928 INFO L87 Difference]: Start difference. First operand 6604 states and 24218 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:02,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:02,783 INFO L93 Difference]: Finished difference Result 11437 states and 40503 transitions. [2025-04-13 23:27:02,783 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:02,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 23:27:02,783 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:02,829 INFO L225 Difference]: With dead ends: 11437 [2025-04-13 23:27:02,829 INFO L226 Difference]: Without dead ends: 11291 [2025-04-13 23:27:02,833 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:27:02,834 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 283 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:02,834 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 134 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:27:02,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11291 states. [2025-04-13 23:27:02,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11291 to 6572. [2025-04-13 23:27:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6572 states, 6571 states have (on average 3.6703698067265256) internal successors, (24118), 6571 states have internal predecessors, (24118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:02,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6572 states to 6572 states and 24118 transitions. [2025-04-13 23:27:02,995 INFO L79 Accepts]: Start accepts. Automaton has 6572 states and 24118 transitions. Word has length 54 [2025-04-13 23:27:02,995 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:02,995 INFO L485 AbstractCegarLoop]: Abstraction has 6572 states and 24118 transitions. [2025-04-13 23:27:02,995 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:02,995 INFO L278 IsEmpty]: Start isEmpty. Operand 6572 states and 24118 transitions. [2025-04-13 23:27:03,006 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:03,006 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:03,006 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:03,006 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2025-04-13 23:27:03,006 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 23:27:03,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:03,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1002860349, now seen corresponding path program 149 times [2025-04-13 23:27:03,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:03,007 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330719594] [2025-04-13 23:27:03,007 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:27:03,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:03,010 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:03,019 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:03,020 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:27:03,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:03,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:03,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:03,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330719594] [2025-04-13 23:27:03,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330719594] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:03,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:03,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:03,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404261467] [2025-04-13 23:27:03,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:03,649 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:03,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:03,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:03,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:03,649 INFO L87 Difference]: Start difference. First operand 6572 states and 24118 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:04,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:04,559 INFO L93 Difference]: Finished difference Result 12905 states and 45817 transitions. [2025-04-13 23:27:04,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:04,560 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:27:04,560 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:04,611 INFO L225 Difference]: With dead ends: 12905 [2025-04-13 23:27:04,611 INFO L226 Difference]: Without dead ends: 12824 [2025-04-13 23:27:04,616 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 23:27:04,616 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 300 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:04,616 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 101 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:27:04,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12824 states. [2025-04-13 23:27:04,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12824 to 6561. [2025-04-13 23:27:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6561 states, 6560 states have (on average 3.671646341463415) internal successors, (24086), 6560 states have internal predecessors, (24086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:04,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6561 states to 6561 states and 24086 transitions. [2025-04-13 23:27:04,809 INFO L79 Accepts]: Start accepts. Automaton has 6561 states and 24086 transitions. Word has length 54 [2025-04-13 23:27:04,809 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:04,809 INFO L485 AbstractCegarLoop]: Abstraction has 6561 states and 24086 transitions. [2025-04-13 23:27:04,809 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:04,809 INFO L278 IsEmpty]: Start isEmpty. Operand 6561 states and 24086 transitions. [2025-04-13 23:27:04,820 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:04,820 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:04,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 23:27:04,821 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2025-04-13 23:27:04,821 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 23:27:04,821 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:04,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1990922253, now seen corresponding path program 150 times [2025-04-13 23:27:04,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:04,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349380482] [2025-04-13 23:27:04,822 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:27:04,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:04,824 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:04,835 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:04,835 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:27:04,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:05,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 23:27:05,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:05,400 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349380482] [2025-04-13 23:27:05,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349380482] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:05,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:05,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:05,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657020690] [2025-04-13 23:27:05,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:05,401 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:05,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:05,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:05,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:05,401 INFO L87 Difference]: Start difference. First operand 6561 states and 24086 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:06,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:06,454 INFO L93 Difference]: Finished difference Result 11563 states and 40932 transitions. [2025-04-13 23:27:06,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:06,455 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:27:06,455 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:06,504 INFO L225 Difference]: With dead ends: 11563 [2025-04-13 23:27:06,505 INFO L226 Difference]: Without dead ends: 11446 [2025-04-13 23:27:06,508 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:27:06,508 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 317 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:06,508 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 116 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:27:06,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11446 states. [2025-04-13 23:27:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11446 to 6660. [2025-04-13 23:27:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6660 states, 6659 states have (on average 3.661811082745157) internal successors, (24384), 6659 states have internal predecessors, (24384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 24384 transitions. [2025-04-13 23:27:06,659 INFO L79 Accepts]: Start accepts. Automaton has 6660 states and 24384 transitions. Word has length 54 [2025-04-13 23:27:06,659 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:06,659 INFO L485 AbstractCegarLoop]: Abstraction has 6660 states and 24384 transitions. [2025-04-13 23:27:06,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 23:27:06,659 INFO L278 IsEmpty]: Start isEmpty. Operand 6660 states and 24384 transitions. [2025-04-13 23:27:06,669 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:06,669 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:06,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:06,669 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2025-04-13 23:27:06,669 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 23:27:06,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:06,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1778589883, now seen corresponding path program 151 times [2025-04-13 23:27:06,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:06,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354478993] [2025-04-13 23:27:06,670 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:27:06,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:06,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:06,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:06,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:27:06,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:07,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:07,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:07,279 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354478993] [2025-04-13 23:27:07,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354478993] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:07,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:07,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:07,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725239469] [2025-04-13 23:27:07,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:07,279 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:07,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:07,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:07,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:07,280 INFO L87 Difference]: Start difference. First operand 6660 states and 24384 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:08,164 INFO L93 Difference]: Finished difference Result 12949 states and 45953 transitions. [2025-04-13 23:27:08,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:08,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 23:27:08,164 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:08,215 INFO L225 Difference]: With dead ends: 12949 [2025-04-13 23:27:08,216 INFO L226 Difference]: Without dead ends: 12881 [2025-04-13 23:27:08,221 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:27:08,221 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 309 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:08,221 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 89 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:27:08,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12881 states. [2025-04-13 23:27:08,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12881 to 6670. [2025-04-13 23:27:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6670 states, 6669 states have (on average 3.6600689758584495) internal successors, (24409), 6669 states have internal predecessors, (24409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6670 states to 6670 states and 24409 transitions. [2025-04-13 23:27:08,397 INFO L79 Accepts]: Start accepts. Automaton has 6670 states and 24409 transitions. Word has length 54 [2025-04-13 23:27:08,397 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:08,397 INFO L485 AbstractCegarLoop]: Abstraction has 6670 states and 24409 transitions. [2025-04-13 23:27:08,397 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:08,397 INFO L278 IsEmpty]: Start isEmpty. Operand 6670 states and 24409 transitions. [2025-04-13 23:27:08,408 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:08,409 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:08,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 23:27:08,409 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2025-04-13 23:27:08,409 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 23:27:08,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:08,409 INFO L85 PathProgramCache]: Analyzing trace with hash 555854763, now seen corresponding path program 152 times [2025-04-13 23:27:08,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:08,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037125920] [2025-04-13 23:27:08,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:27:08,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:08,412 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:08,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:08,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:27:08,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:09,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:09,016 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037125920] [2025-04-13 23:27:09,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037125920] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:09,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:09,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:09,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413055928] [2025-04-13 23:27:09,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:09,016 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:09,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:09,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:09,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:09,016 INFO L87 Difference]: Start difference. First operand 6670 states and 24409 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:09,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:09,958 INFO L93 Difference]: Finished difference Result 11608 states and 41017 transitions. [2025-04-13 23:27:09,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:09,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 23:27:09,958 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:10,002 INFO L225 Difference]: With dead ends: 11608 [2025-04-13 23:27:10,003 INFO L226 Difference]: Without dead ends: 11537 [2025-04-13 23:27:10,007 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:27:10,007 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 298 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:10,007 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 128 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:27:10,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11537 states. [2025-04-13 23:27:10,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11537 to 6681. [2025-04-13 23:27:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6681 states, 6680 states have (on average 3.6580838323353295) internal successors, (24436), 6680 states have internal predecessors, (24436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:10,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6681 states to 6681 states and 24436 transitions. [2025-04-13 23:27:10,167 INFO L79 Accepts]: Start accepts. Automaton has 6681 states and 24436 transitions. Word has length 54 [2025-04-13 23:27:10,167 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:10,167 INFO L485 AbstractCegarLoop]: Abstraction has 6681 states and 24436 transitions. [2025-04-13 23:27:10,167 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:10,167 INFO L278 IsEmpty]: Start isEmpty. Operand 6681 states and 24436 transitions. [2025-04-13 23:27:10,178 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:10,178 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:10,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:10,178 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2025-04-13 23:27:10,179 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 23:27:10,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:10,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1008111901, now seen corresponding path program 153 times [2025-04-13 23:27:10,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:10,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808408521] [2025-04-13 23:27:10,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:27:10,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:10,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:10,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:10,192 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:27:10,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:10,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:10,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808408521] [2025-04-13 23:27:10,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808408521] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:10,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:10,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:10,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098394567] [2025-04-13 23:27:10,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:10,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:10,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:10,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:10,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:10,801 INFO L87 Difference]: Start difference. First operand 6681 states and 24436 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:11,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:11,830 INFO L93 Difference]: Finished difference Result 12914 states and 45862 transitions. [2025-04-13 23:27:11,830 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:11,830 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:27:11,830 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:11,878 INFO L225 Difference]: With dead ends: 12914 [2025-04-13 23:27:11,878 INFO L226 Difference]: Without dead ends: 12829 [2025-04-13 23:27:11,881 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:27:11,881 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 284 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:11,881 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 105 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:27:11,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12829 states. [2025-04-13 23:27:11,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12829 to 6666. [2025-04-13 23:27:11,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6666 states, 6665 states have (on average 3.6603150787696923) internal successors, (24396), 6665 states have internal predecessors, (24396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:12,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6666 states to 6666 states and 24396 transitions. [2025-04-13 23:27:12,028 INFO L79 Accepts]: Start accepts. Automaton has 6666 states and 24396 transitions. Word has length 54 [2025-04-13 23:27:12,029 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:12,029 INFO L485 AbstractCegarLoop]: Abstraction has 6666 states and 24396 transitions. [2025-04-13 23:27:12,029 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:12,029 INFO L278 IsEmpty]: Start isEmpty. Operand 6666 states and 24396 transitions. [2025-04-13 23:27:12,039 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:12,040 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:12,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:12,040 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2025-04-13 23:27:12,040 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 23:27:12,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:12,040 INFO L85 PathProgramCache]: Analyzing trace with hash -384280563, now seen corresponding path program 154 times [2025-04-13 23:27:12,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:12,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046123825] [2025-04-13 23:27:12,040 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:27:12,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:12,043 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:27:12,054 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 23:27:12,054 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:27:12,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:12,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:12,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:12,572 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046123825] [2025-04-13 23:27:12,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046123825] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:12,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:12,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:12,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868085809] [2025-04-13 23:27:12,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:12,572 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:12,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:12,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:12,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:12,572 INFO L87 Difference]: Start difference. First operand 6666 states and 24396 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:13,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:13,425 INFO L93 Difference]: Finished difference Result 11522 states and 40786 transitions. [2025-04-13 23:27:13,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:13,426 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:27:13,426 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:13,477 INFO L225 Difference]: With dead ends: 11522 [2025-04-13 23:27:13,478 INFO L226 Difference]: Without dead ends: 11419 [2025-04-13 23:27:13,482 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:27:13,482 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 279 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 1720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:13,482 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 140 Invalid, 1720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1704 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:27:13,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11419 states. [2025-04-13 23:27:13,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11419 to 6633. [2025-04-13 23:27:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6633 states, 6632 states have (on average 3.6629975874547647) internal successors, (24293), 6632 states have internal predecessors, (24293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:13,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6633 states to 6633 states and 24293 transitions. [2025-04-13 23:27:13,650 INFO L79 Accepts]: Start accepts. Automaton has 6633 states and 24293 transitions. Word has length 54 [2025-04-13 23:27:13,651 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:13,651 INFO L485 AbstractCegarLoop]: Abstraction has 6633 states and 24293 transitions. [2025-04-13 23:27:13,651 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:13,651 INFO L278 IsEmpty]: Start isEmpty. Operand 6633 states and 24293 transitions. [2025-04-13 23:27:13,662 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:13,662 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:13,662 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:13,662 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2025-04-13 23:27:13,662 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 23:27:13,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:13,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1614827199, now seen corresponding path program 155 times [2025-04-13 23:27:13,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:13,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281832451] [2025-04-13 23:27:13,662 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:27:13,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:13,665 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:13,675 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:13,676 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:27:13,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:14,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 23:27:14,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:14,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281832451] [2025-04-13 23:27:14,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281832451] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:14,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:14,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:14,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583783877] [2025-04-13 23:27:14,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:14,309 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:14,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:14,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:14,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:14,310 INFO L87 Difference]: Start difference. First operand 6633 states and 24293 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:15,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:15,227 INFO L93 Difference]: Finished difference Result 13006 states and 46111 transitions. [2025-04-13 23:27:15,227 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:15,227 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:27:15,227 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:15,278 INFO L225 Difference]: With dead ends: 13006 [2025-04-13 23:27:15,278 INFO L226 Difference]: Without dead ends: 12889 [2025-04-13 23:27:15,283 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 23:27:15,284 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 283 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 104 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 23:27:15,284 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 104 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:27:15,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12889 states. [2025-04-13 23:27:15,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12889 to 6655. [2025-04-13 23:27:15,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6655 states, 6654 states have (on average 3.6590021039975955) internal successors, (24347), 6654 states have internal predecessors, (24347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6655 states to 6655 states and 24347 transitions. [2025-04-13 23:27:15,452 INFO L79 Accepts]: Start accepts. Automaton has 6655 states and 24347 transitions. Word has length 54 [2025-04-13 23:27:15,452 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:15,452 INFO L485 AbstractCegarLoop]: Abstraction has 6655 states and 24347 transitions. [2025-04-13 23:27:15,452 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:15,452 INFO L278 IsEmpty]: Start isEmpty. Operand 6655 states and 24347 transitions. [2025-04-13 23:27:15,463 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:15,464 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:15,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 23:27:15,464 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2025-04-13 23:27:15,464 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 23:27:15,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:15,464 INFO L85 PathProgramCache]: Analyzing trace with hash 637253819, now seen corresponding path program 156 times [2025-04-13 23:27:15,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:15,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161980308] [2025-04-13 23:27:15,464 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:27:15,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:15,467 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:15,476 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:15,476 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:27:15,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:16,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:16,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:16,084 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161980308] [2025-04-13 23:27:16,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161980308] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:16,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:16,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:16,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009463495] [2025-04-13 23:27:16,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:16,084 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:16,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:16,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:16,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:16,085 INFO L87 Difference]: Start difference. First operand 6655 states and 24347 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:16,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:16,949 INFO L93 Difference]: Finished difference Result 11560 states and 40852 transitions. [2025-04-13 23:27:16,950 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:16,950 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:27:16,950 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:16,995 INFO L225 Difference]: With dead ends: 11560 [2025-04-13 23:27:16,995 INFO L226 Difference]: Without dead ends: 11489 [2025-04-13 23:27:16,999 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:27:17,000 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 298 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:17,000 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 109 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:27:17,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11489 states. [2025-04-13 23:27:17,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11489 to 6688. [2025-04-13 23:27:17,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6688 states, 6687 states have (on average 3.656348138178555) internal successors, (24450), 6687 states have internal predecessors, (24450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6688 states to 6688 states and 24450 transitions. [2025-04-13 23:27:17,148 INFO L79 Accepts]: Start accepts. Automaton has 6688 states and 24450 transitions. Word has length 54 [2025-04-13 23:27:17,148 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:17,148 INFO L485 AbstractCegarLoop]: Abstraction has 6688 states and 24450 transitions. [2025-04-13 23:27:17,149 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:17,149 INFO L278 IsEmpty]: Start isEmpty. Operand 6688 states and 24450 transitions. [2025-04-13 23:27:17,158 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:17,159 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:17,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 23:27:17,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2025-04-13 23:27:17,159 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 23:27:17,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:17,159 INFO L85 PathProgramCache]: Analyzing trace with hash 179759709, now seen corresponding path program 157 times [2025-04-13 23:27:17,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:17,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396639066] [2025-04-13 23:27:17,159 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:27:17,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:17,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:17,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:17,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:27:17,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:17,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 23:27:17,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:17,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396639066] [2025-04-13 23:27:17,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396639066] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:17,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:17,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:17,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272817688] [2025-04-13 23:27:17,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:17,810 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:17,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:17,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:17,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:17,810 INFO L87 Difference]: Start difference. First operand 6688 states and 24450 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:18,761 INFO L93 Difference]: Finished difference Result 13003 states and 46094 transitions. [2025-04-13 23:27:18,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:18,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 23:27:18,762 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:18,810 INFO L225 Difference]: With dead ends: 13003 [2025-04-13 23:27:18,810 INFO L226 Difference]: Without dead ends: 12932 [2025-04-13 23:27:18,814 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 23:27:18,814 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 279 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:18,815 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 118 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1621 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:27:18,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12932 states. [2025-04-13 23:27:18,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12932 to 6688. [2025-04-13 23:27:18,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6688 states, 6687 states have (on average 3.656348138178555) internal successors, (24450), 6687 states have internal predecessors, (24450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:18,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6688 states to 6688 states and 24450 transitions. [2025-04-13 23:27:18,984 INFO L79 Accepts]: Start accepts. Automaton has 6688 states and 24450 transitions. Word has length 54 [2025-04-13 23:27:18,984 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:18,984 INFO L485 AbstractCegarLoop]: Abstraction has 6688 states and 24450 transitions. [2025-04-13 23:27:18,984 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:18,984 INFO L278 IsEmpty]: Start isEmpty. Operand 6688 states and 24450 transitions. [2025-04-13 23:27:18,995 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:18,995 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:18,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 23:27:18,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2025-04-13 23:27:18,995 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 23:27:18,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:18,995 INFO L85 PathProgramCache]: Analyzing trace with hash -302881507, now seen corresponding path program 158 times [2025-04-13 23:27:18,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:18,995 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872199818] [2025-04-13 23:27:18,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:27:18,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:18,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:19,007 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:19,007 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:27:19,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:19,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:19,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872199818] [2025-04-13 23:27:19,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872199818] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:19,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:19,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:19,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104516580] [2025-04-13 23:27:19,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:19,599 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:19,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:19,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:19,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:19,599 INFO L87 Difference]: Start difference. First operand 6688 states and 24450 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:20,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:20,551 INFO L93 Difference]: Finished difference Result 11570 states and 40866 transitions. [2025-04-13 23:27:20,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:20,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 23:27:20,551 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:20,600 INFO L225 Difference]: With dead ends: 11570 [2025-04-13 23:27:20,601 INFO L226 Difference]: Without dead ends: 11489 [2025-04-13 23:27:20,605 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:27:20,605 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 302 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:20,605 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 109 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:27:20,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11489 states. [2025-04-13 23:27:20,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11489 to 6688. [2025-04-13 23:27:20,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6688 states, 6687 states have (on average 3.6547031553761027) internal successors, (24439), 6687 states have internal predecessors, (24439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:20,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6688 states to 6688 states and 24439 transitions. [2025-04-13 23:27:20,803 INFO L79 Accepts]: Start accepts. Automaton has 6688 states and 24439 transitions. Word has length 54 [2025-04-13 23:27:20,803 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:20,804 INFO L485 AbstractCegarLoop]: Abstraction has 6688 states and 24439 transitions. [2025-04-13 23:27:20,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 23:27:20,804 INFO L278 IsEmpty]: Start isEmpty. Operand 6688 states and 24439 transitions. [2025-04-13 23:27:20,814 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:20,815 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:20,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:20,815 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2025-04-13 23:27:20,815 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 23:27:20,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:20,816 INFO L85 PathProgramCache]: Analyzing trace with hash -760375617, now seen corresponding path program 159 times [2025-04-13 23:27:20,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:20,816 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864176499] [2025-04-13 23:27:20,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:27:20,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:20,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:20,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:20,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:27:20,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:21,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:21,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:21,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864176499] [2025-04-13 23:27:21,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864176499] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:21,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:21,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:21,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630587757] [2025-04-13 23:27:21,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:21,447 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:21,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:21,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:21,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:21,447 INFO L87 Difference]: Start difference. First operand 6688 states and 24439 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:22,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:22,400 INFO L93 Difference]: Finished difference Result 12921 states and 45865 transitions. [2025-04-13 23:27:22,400 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:22,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 23:27:22,401 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:22,454 INFO L225 Difference]: With dead ends: 12921 [2025-04-13 23:27:22,454 INFO L226 Difference]: Without dead ends: 12808 [2025-04-13 23:27:22,459 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:27:22,459 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 279 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:22,459 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 102 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:27:22,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12808 states. [2025-04-13 23:27:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12808 to 6645. [2025-04-13 23:27:22,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6645 states, 6644 states have (on average 3.660897049969898) internal successors, (24323), 6644 states have internal predecessors, (24323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6645 states to 6645 states and 24323 transitions. [2025-04-13 23:27:22,630 INFO L79 Accepts]: Start accepts. Automaton has 6645 states and 24323 transitions. Word has length 54 [2025-04-13 23:27:22,630 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:22,630 INFO L485 AbstractCegarLoop]: Abstraction has 6645 states and 24323 transitions. [2025-04-13 23:27:22,630 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:22,631 INFO L278 IsEmpty]: Start isEmpty. Operand 6645 states and 24323 transitions. [2025-04-13 23:27:22,641 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:22,642 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:22,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:22,642 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2025-04-13 23:27:22,642 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 23:27:22,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:22,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1310685227, now seen corresponding path program 160 times [2025-04-13 23:27:22,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:22,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511849320] [2025-04-13 23:27:22,642 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:27:22,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:22,645 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:27:22,655 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 23:27:22,655 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:27:22,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:23,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:23,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:23,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511849320] [2025-04-13 23:27:23,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511849320] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:23,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:23,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:23,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11658228] [2025-04-13 23:27:23,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:23,284 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:23,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:23,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:23,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:23,284 INFO L87 Difference]: Start difference. First operand 6645 states and 24323 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:24,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:24,174 INFO L93 Difference]: Finished difference Result 11446 states and 40534 transitions. [2025-04-13 23:27:24,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:24,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 23:27:24,174 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:24,218 INFO L225 Difference]: With dead ends: 11446 [2025-04-13 23:27:24,218 INFO L226 Difference]: Without dead ends: 11198 [2025-04-13 23:27:24,222 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:27:24,222 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 276 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1768 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:24,222 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 144 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1768 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:27:24,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11198 states. [2025-04-13 23:27:24,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11198 to 6511. [2025-04-13 23:27:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6511 states, 6510 states have (on average 3.6737327188940094) internal successors, (23916), 6510 states have internal predecessors, (23916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6511 states to 6511 states and 23916 transitions. [2025-04-13 23:27:24,378 INFO L79 Accepts]: Start accepts. Automaton has 6511 states and 23916 transitions. Word has length 54 [2025-04-13 23:27:24,378 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:24,378 INFO L485 AbstractCegarLoop]: Abstraction has 6511 states and 23916 transitions. [2025-04-13 23:27:24,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 23:27:24,379 INFO L278 IsEmpty]: Start isEmpty. Operand 6511 states and 23916 transitions. [2025-04-13 23:27:24,389 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:24,389 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:24,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:24,389 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2025-04-13 23:27:24,389 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 23:27:24,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:24,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1713587219, now seen corresponding path program 161 times [2025-04-13 23:27:24,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:24,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288600141] [2025-04-13 23:27:24,390 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:27:24,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:24,392 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:24,402 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:24,403 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:27:24,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:25,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 23:27:25,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:25,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288600141] [2025-04-13 23:27:25,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288600141] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:25,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:25,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:25,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140093256] [2025-04-13 23:27:25,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:25,014 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:25,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:25,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:25,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:25,014 INFO L87 Difference]: Start difference. First operand 6511 states and 23916 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:26,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:26,011 INFO L93 Difference]: Finished difference Result 12889 states and 45773 transitions. [2025-04-13 23:27:26,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:26,011 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:27:26,011 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:26,060 INFO L225 Difference]: With dead ends: 12889 [2025-04-13 23:27:26,060 INFO L226 Difference]: Without dead ends: 12818 [2025-04-13 23:27:26,065 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:27:26,065 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 278 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:26,065 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 119 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:27:26,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12818 states. [2025-04-13 23:27:26,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12818 to 6536. [2025-04-13 23:27:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6536 states, 6535 states have (on average 3.6726855394032136) internal successors, (24001), 6535 states have internal predecessors, (24001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:26,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 24001 transitions. [2025-04-13 23:27:26,234 INFO L79 Accepts]: Start accepts. Automaton has 6536 states and 24001 transitions. Word has length 54 [2025-04-13 23:27:26,234 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:26,234 INFO L485 AbstractCegarLoop]: Abstraction has 6536 states and 24001 transitions. [2025-04-13 23:27:26,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 23:27:26,234 INFO L278 IsEmpty]: Start isEmpty. Operand 6536 states and 24001 transitions. [2025-04-13 23:27:26,245 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:26,246 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:26,246 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:26,246 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2025-04-13 23:27:26,246 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 23:27:26,246 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:26,246 INFO L85 PathProgramCache]: Analyzing trace with hash -414096601, now seen corresponding path program 162 times [2025-04-13 23:27:26,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:26,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50422746] [2025-04-13 23:27:26,246 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:27:26,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:26,249 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:26,259 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:26,259 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:27:26,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:26,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:26,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50422746] [2025-04-13 23:27:26,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50422746] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:26,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:26,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:26,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236556494] [2025-04-13 23:27:26,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:26,816 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:26,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:26,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:26,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:26,817 INFO L87 Difference]: Start difference. First operand 6536 states and 24001 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:27,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:27,733 INFO L93 Difference]: Finished difference Result 11587 states and 40988 transitions. [2025-04-13 23:27:27,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:27,733 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:27:27,733 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:27,778 INFO L225 Difference]: With dead ends: 11587 [2025-04-13 23:27:27,778 INFO L226 Difference]: Without dead ends: 11470 [2025-04-13 23:27:27,781 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:27:27,781 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 296 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:27,781 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 116 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:27:27,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11470 states. [2025-04-13 23:27:27,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11470 to 6717. [2025-04-13 23:27:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6717 states, 6716 states have (on average 3.653067301965456) internal successors, (24534), 6716 states have internal predecessors, (24534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6717 states to 6717 states and 24534 transitions. [2025-04-13 23:27:27,938 INFO L79 Accepts]: Start accepts. Automaton has 6717 states and 24534 transitions. Word has length 54 [2025-04-13 23:27:27,939 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:27,939 INFO L485 AbstractCegarLoop]: Abstraction has 6717 states and 24534 transitions. [2025-04-13 23:27:27,939 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:27,939 INFO L278 IsEmpty]: Start isEmpty. Operand 6717 states and 24534 transitions. [2025-04-13 23:27:27,950 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:27,950 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:27,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 23:27:27,950 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2025-04-13 23:27:27,950 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 23:27:27,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:27,951 INFO L85 PathProgramCache]: Analyzing trace with hash -913582643, now seen corresponding path program 163 times [2025-04-13 23:27:27,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:27,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594661638] [2025-04-13 23:27:27,951 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:27:27,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:27,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:27,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:27,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:27:27,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:28,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:28,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594661638] [2025-04-13 23:27:28,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594661638] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:28,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:28,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:28,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968138537] [2025-04-13 23:27:28,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:28,570 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:28,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:28,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:28,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:28,570 INFO L87 Difference]: Start difference. First operand 6717 states and 24534 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:29,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:29,512 INFO L93 Difference]: Finished difference Result 13067 states and 46289 transitions. [2025-04-13 23:27:29,512 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:29,512 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:27:29,512 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:29,566 INFO L225 Difference]: With dead ends: 13067 [2025-04-13 23:27:29,566 INFO L226 Difference]: Without dead ends: 12989 [2025-04-13 23:27:29,571 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:27:29,571 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 288 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 105 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 23:27:29,571 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 105 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:27:29,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12989 states. [2025-04-13 23:27:29,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12989 to 6707. [2025-04-13 23:27:29,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6707 states, 6706 states have (on average 3.654041157172681) internal successors, (24504), 6706 states have internal predecessors, (24504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:29,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6707 states to 6707 states and 24504 transitions. [2025-04-13 23:27:29,746 INFO L79 Accepts]: Start accepts. Automaton has 6707 states and 24504 transitions. Word has length 54 [2025-04-13 23:27:29,746 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:29,746 INFO L485 AbstractCegarLoop]: Abstraction has 6707 states and 24504 transitions. [2025-04-13 23:27:29,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:29,746 INFO L278 IsEmpty]: Start isEmpty. Operand 6707 states and 24504 transitions. [2025-04-13 23:27:29,757 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:29,757 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:29,757 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:29,757 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2025-04-13 23:27:29,757 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 23:27:29,758 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:29,758 INFO L85 PathProgramCache]: Analyzing trace with hash 897880871, now seen corresponding path program 164 times [2025-04-13 23:27:29,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:29,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132226231] [2025-04-13 23:27:29,758 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:27:29,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:29,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:29,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:29,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:27:29,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:30,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:30,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:30,386 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132226231] [2025-04-13 23:27:30,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132226231] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:30,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:30,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:30,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803039012] [2025-04-13 23:27:30,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:30,386 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:30,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:30,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:30,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:30,386 INFO L87 Difference]: Start difference. First operand 6707 states and 24504 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:31,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:31,423 INFO L93 Difference]: Finished difference Result 11612 states and 41018 transitions. [2025-04-13 23:27:31,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:31,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 23:27:31,423 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:31,471 INFO L225 Difference]: With dead ends: 11612 [2025-04-13 23:27:31,471 INFO L226 Difference]: Without dead ends: 11541 [2025-04-13 23:27:31,475 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:27:31,476 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 289 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:31,476 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 130 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:27:31,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11541 states. [2025-04-13 23:27:31,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11541 to 6718. [2025-04-13 23:27:31,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6718 states, 6717 states have (on average 3.6520768200089324) internal successors, (24531), 6717 states have internal predecessors, (24531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:31,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6718 states to 6718 states and 24531 transitions. [2025-04-13 23:27:31,649 INFO L79 Accepts]: Start accepts. Automaton has 6718 states and 24531 transitions. Word has length 54 [2025-04-13 23:27:31,649 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:31,649 INFO L485 AbstractCegarLoop]: Abstraction has 6718 states and 24531 transitions. [2025-04-13 23:27:31,649 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:31,649 INFO L278 IsEmpty]: Start isEmpty. Operand 6718 states and 24531 transitions. [2025-04-13 23:27:31,660 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:31,661 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:31,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 23:27:31,661 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2025-04-13 23:27:31,661 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 23:27:31,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:31,661 INFO L85 PathProgramCache]: Analyzing trace with hash 171399115, now seen corresponding path program 165 times [2025-04-13 23:27:31,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:31,661 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124108631] [2025-04-13 23:27:31,661 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:27:31,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:31,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:31,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:31,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:27:31,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:32,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:32,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:32,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124108631] [2025-04-13 23:27:32,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124108631] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:32,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:32,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:32,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558161889] [2025-04-13 23:27:32,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:32,308 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:32,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:32,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:32,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:32,309 INFO L87 Difference]: Start difference. First operand 6718 states and 24531 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:33,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:33,206 INFO L93 Difference]: Finished difference Result 13152 states and 46509 transitions. [2025-04-13 23:27:33,206 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:33,206 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:27:33,206 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:33,257 INFO L225 Difference]: With dead ends: 13152 [2025-04-13 23:27:33,257 INFO L226 Difference]: Without dead ends: 13081 [2025-04-13 23:27:33,262 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 23:27:33,262 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 326 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:33,262 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 91 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:27:33,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13081 states. [2025-04-13 23:27:33,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13081 to 6718. [2025-04-13 23:27:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6718 states, 6717 states have (on average 3.6520768200089324) internal successors, (24531), 6717 states have internal predecessors, (24531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:33,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6718 states to 6718 states and 24531 transitions. [2025-04-13 23:27:33,435 INFO L79 Accepts]: Start accepts. Automaton has 6718 states and 24531 transitions. Word has length 54 [2025-04-13 23:27:33,435 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:33,435 INFO L485 AbstractCegarLoop]: Abstraction has 6718 states and 24531 transitions. [2025-04-13 23:27:33,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 23:27:33,435 INFO L278 IsEmpty]: Start isEmpty. Operand 6718 states and 24531 transitions. [2025-04-13 23:27:33,446 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:33,446 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:33,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 23:27:33,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2025-04-13 23:27:33,446 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 23:27:33,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:33,447 INFO L85 PathProgramCache]: Analyzing trace with hash -42254455, now seen corresponding path program 166 times [2025-04-13 23:27:33,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:33,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556278126] [2025-04-13 23:27:33,447 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:27:33,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:33,449 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:27:33,459 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 23:27:33,459 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:27:33,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:33,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:33,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:33,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556278126] [2025-04-13 23:27:33,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556278126] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:33,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:33,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:33,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885797634] [2025-04-13 23:27:33,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:33,978 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:33,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:33,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:33,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:33,978 INFO L87 Difference]: Start difference. First operand 6718 states and 24531 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:34,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:34,776 INFO L93 Difference]: Finished difference Result 11552 states and 40854 transitions. [2025-04-13 23:27:34,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:34,776 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:27:34,776 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:34,819 INFO L225 Difference]: With dead ends: 11552 [2025-04-13 23:27:34,819 INFO L226 Difference]: Without dead ends: 11449 [2025-04-13 23:27:34,823 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:27:34,823 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 270 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 1642 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:34,823 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 133 Invalid, 1657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1642 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:27:34,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11449 states. [2025-04-13 23:27:34,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11449 to 6696. [2025-04-13 23:27:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6696 states, 6695 states have (on average 3.652725914861837) internal successors, (24455), 6695 states have internal predecessors, (24455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:34,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6696 states to 6696 states and 24455 transitions. [2025-04-13 23:27:34,981 INFO L79 Accepts]: Start accepts. Automaton has 6696 states and 24455 transitions. Word has length 54 [2025-04-13 23:27:34,981 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:34,981 INFO L485 AbstractCegarLoop]: Abstraction has 6696 states and 24455 transitions. [2025-04-13 23:27:34,981 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:34,981 INFO L278 IsEmpty]: Start isEmpty. Operand 6696 states and 24455 transitions. [2025-04-13 23:27:34,992 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:34,992 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:34,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 23:27:34,992 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2025-04-13 23:27:34,992 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 23:27:34,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:34,992 INFO L85 PathProgramCache]: Analyzing trace with hash -768736211, now seen corresponding path program 167 times [2025-04-13 23:27:34,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:34,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947025765] [2025-04-13 23:27:34,992 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:27:34,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:34,995 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:35,006 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:35,006 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:27:35,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:35,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:35,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947025765] [2025-04-13 23:27:35,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947025765] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:35,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:35,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:35,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611648523] [2025-04-13 23:27:35,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:35,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:35,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:35,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:35,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:35,609 INFO L87 Difference]: Start difference. First operand 6696 states and 24455 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:36,585 INFO L93 Difference]: Finished difference Result 13070 states and 46280 transitions. [2025-04-13 23:27:36,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:36,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 23:27:36,585 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:36,644 INFO L225 Difference]: With dead ends: 13070 [2025-04-13 23:27:36,644 INFO L226 Difference]: Without dead ends: 12989 [2025-04-13 23:27:36,648 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:27:36,649 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 287 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:36,649 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 110 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1605 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:27:36,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12989 states. [2025-04-13 23:27:36,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12989 to 6685. [2025-04-13 23:27:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6685 states, 6684 states have (on average 3.6539497307001794) internal successors, (24423), 6684 states have internal predecessors, (24423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:36,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6685 states to 6685 states and 24423 transitions. [2025-04-13 23:27:36,875 INFO L79 Accepts]: Start accepts. Automaton has 6685 states and 24423 transitions. Word has length 54 [2025-04-13 23:27:36,875 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:36,875 INFO L485 AbstractCegarLoop]: Abstraction has 6685 states and 24423 transitions. [2025-04-13 23:27:36,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 23:27:36,875 INFO L278 IsEmpty]: Start isEmpty. Operand 6685 states and 24423 transitions. [2025-04-13 23:27:36,886 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:36,886 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:36,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:36,886 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2025-04-13 23:27:36,886 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 23:27:36,887 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:36,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1576616585, now seen corresponding path program 168 times [2025-04-13 23:27:36,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:36,887 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859519728] [2025-04-13 23:27:36,887 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:27:36,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:36,889 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:36,898 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:36,898 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:27:36,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:37,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:37,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:37,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859519728] [2025-04-13 23:27:37,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859519728] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:37,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:37,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:37,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82747044] [2025-04-13 23:27:37,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:37,452 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:37,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:37,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:37,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:37,452 INFO L87 Difference]: Start difference. First operand 6685 states and 24423 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:38,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:38,364 INFO L93 Difference]: Finished difference Result 11557 states and 40834 transitions. [2025-04-13 23:27:38,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:38,364 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:27:38,364 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:38,409 INFO L225 Difference]: With dead ends: 11557 [2025-04-13 23:27:38,409 INFO L226 Difference]: Without dead ends: 11486 [2025-04-13 23:27:38,412 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 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 23:27:38,413 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 282 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:38,413 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 127 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1553 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:27:38,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11486 states. [2025-04-13 23:27:38,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11486 to 6718. [2025-04-13 23:27:38,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6718 states, 6717 states have (on average 3.6513324400774154) internal successors, (24526), 6717 states have internal predecessors, (24526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:38,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6718 states to 6718 states and 24526 transitions. [2025-04-13 23:27:38,561 INFO L79 Accepts]: Start accepts. Automaton has 6718 states and 24526 transitions. Word has length 54 [2025-04-13 23:27:38,562 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:38,562 INFO L485 AbstractCegarLoop]: Abstraction has 6718 states and 24526 transitions. [2025-04-13 23:27:38,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 23:27:38,562 INFO L278 IsEmpty]: Start isEmpty. Operand 6718 states and 24526 transitions. [2025-04-13 23:27:38,572 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:38,573 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:38,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:38,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2025-04-13 23:27:38,573 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 23:27:38,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:38,573 INFO L85 PathProgramCache]: Analyzing trace with hash 6993323, now seen corresponding path program 169 times [2025-04-13 23:27:38,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:38,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017641706] [2025-04-13 23:27:38,573 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:27:38,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:38,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:38,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:38,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:27:38,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:39,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:39,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:39,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017641706] [2025-04-13 23:27:39,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017641706] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:39,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:39,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:39,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775781331] [2025-04-13 23:27:39,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:39,248 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:39,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:39,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:39,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:39,248 INFO L87 Difference]: Start difference. First operand 6718 states and 24526 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:40,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:40,157 INFO L93 Difference]: Finished difference Result 13148 states and 46494 transitions. [2025-04-13 23:27:40,158 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:40,158 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:27:40,158 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:40,209 INFO L225 Difference]: With dead ends: 13148 [2025-04-13 23:27:40,209 INFO L226 Difference]: Without dead ends: 13080 [2025-04-13 23:27:40,214 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 23:27:40,214 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 310 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:40,214 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 100 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:27:40,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13080 states. [2025-04-13 23:27:40,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13080 to 6728. [2025-04-13 23:27:40,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6728 states, 6727 states have (on average 3.6496209305782665) internal successors, (24551), 6727 states have internal predecessors, (24551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6728 states to 6728 states and 24551 transitions. [2025-04-13 23:27:40,384 INFO L79 Accepts]: Start accepts. Automaton has 6728 states and 24551 transitions. Word has length 54 [2025-04-13 23:27:40,384 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:40,384 INFO L485 AbstractCegarLoop]: Abstraction has 6728 states and 24551 transitions. [2025-04-13 23:27:40,384 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:40,384 INFO L278 IsEmpty]: Start isEmpty. Operand 6728 states and 24551 transitions. [2025-04-13 23:27:40,395 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:40,395 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:40,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:40,395 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2025-04-13 23:27:40,395 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 23:27:40,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:40,396 INFO L85 PathProgramCache]: Analyzing trace with hash 636481259, now seen corresponding path program 170 times [2025-04-13 23:27:40,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:40,396 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604024461] [2025-04-13 23:27:40,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:27:40,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:40,398 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:40,407 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:40,407 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:27:40,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:41,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:41,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:41,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604024461] [2025-04-13 23:27:41,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604024461] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:41,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:41,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:41,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624183521] [2025-04-13 23:27:41,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:41,022 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:41,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:41,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:41,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:41,022 INFO L87 Difference]: Start difference. First operand 6728 states and 24551 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:42,075 INFO L93 Difference]: Finished difference Result 11566 states and 40846 transitions. [2025-04-13 23:27:42,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:42,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 23:27:42,075 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:42,121 INFO L225 Difference]: With dead ends: 11566 [2025-04-13 23:27:42,122 INFO L226 Difference]: Without dead ends: 11485 [2025-04-13 23:27:42,126 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:27:42,126 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 290 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:42,126 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 137 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:27:42,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11485 states. [2025-04-13 23:27:42,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11485 to 6717. [2025-04-13 23:27:42,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6717 states, 6716 states have (on average 3.649940440738535) internal successors, (24513), 6716 states have internal predecessors, (24513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6717 states to 6717 states and 24513 transitions. [2025-04-13 23:27:42,288 INFO L79 Accepts]: Start accepts. Automaton has 6717 states and 24513 transitions. Word has length 54 [2025-04-13 23:27:42,289 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:42,289 INFO L485 AbstractCegarLoop]: Abstraction has 6717 states and 24513 transitions. [2025-04-13 23:27:42,289 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:42,289 INFO L278 IsEmpty]: Start isEmpty. Operand 6717 states and 24513 transitions. [2025-04-13 23:27:42,300 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:42,300 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:42,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:42,300 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2025-04-13 23:27:42,300 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 23:27:42,300 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:42,300 INFO L85 PathProgramCache]: Analyzing trace with hash -763484659, now seen corresponding path program 171 times [2025-04-13 23:27:42,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:42,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132904646] [2025-04-13 23:27:42,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:27:42,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:42,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:42,313 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:42,313 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:27:42,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:42,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:42,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:42,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132904646] [2025-04-13 23:27:42,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132904646] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:42,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:42,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:42,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524960013] [2025-04-13 23:27:42,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:42,916 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:42,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:42,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:42,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:42,916 INFO L87 Difference]: Start difference. First operand 6717 states and 24513 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:43,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:43,941 INFO L93 Difference]: Finished difference Result 13091 states and 46338 transitions. [2025-04-13 23:27:43,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:43,941 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:27:43,941 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:43,990 INFO L225 Difference]: With dead ends: 13091 [2025-04-13 23:27:43,991 INFO L226 Difference]: Without dead ends: 13006 [2025-04-13 23:27:43,993 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:27:43,993 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 293 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:43,993 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 99 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:27:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13006 states. [2025-04-13 23:27:44,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13006 to 6702. [2025-04-13 23:27:44,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6702 states, 6701 states have (on average 3.652141471422176) internal successors, (24473), 6701 states have internal predecessors, (24473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:44,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6702 states to 6702 states and 24473 transitions. [2025-04-13 23:27:44,151 INFO L79 Accepts]: Start accepts. Automaton has 6702 states and 24473 transitions. Word has length 54 [2025-04-13 23:27:44,151 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:44,151 INFO L485 AbstractCegarLoop]: Abstraction has 6702 states and 24473 transitions. [2025-04-13 23:27: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 23:27:44,152 INFO L278 IsEmpty]: Start isEmpty. Operand 6702 states and 24473 transitions. [2025-04-13 23:27:44,162 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:44,162 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:44,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:44,163 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2025-04-13 23:27:44,163 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 23:27:44,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:44,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2044919303, now seen corresponding path program 172 times [2025-04-13 23:27:44,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:44,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011759558] [2025-04-13 23:27:44,163 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:27:44,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:44,166 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:27:44,177 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 23:27:44,178 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:27:44,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:44,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 23:27:44,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:44,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011759558] [2025-04-13 23:27:44,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011759558] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:44,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:44,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:44,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238118088] [2025-04-13 23:27:44,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:44,735 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:44,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:44,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:44,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:44,735 INFO L87 Difference]: Start difference. First operand 6702 states and 24473 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:45,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:45,617 INFO L93 Difference]: Finished difference Result 11470 states and 40590 transitions. [2025-04-13 23:27:45,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:45,618 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:27:45,618 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:45,665 INFO L225 Difference]: With dead ends: 11470 [2025-04-13 23:27:45,665 INFO L226 Difference]: Without dead ends: 11076 [2025-04-13 23:27:45,669 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:27:45,669 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 266 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 1633 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:45,669 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 132 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1633 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:27:45,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11076 states. [2025-04-13 23:27:45,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11076 to 6422. [2025-04-13 23:27:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6422 states, 6421 states have (on average 3.6777760473446506) internal successors, (23615), 6421 states have internal predecessors, (23615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:45,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6422 states to 6422 states and 23615 transitions. [2025-04-13 23:27:45,827 INFO L79 Accepts]: Start accepts. Automaton has 6422 states and 23615 transitions. Word has length 54 [2025-04-13 23:27:45,827 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:45,827 INFO L485 AbstractCegarLoop]: Abstraction has 6422 states and 23615 transitions. [2025-04-13 23:27:45,827 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:45,827 INFO L278 IsEmpty]: Start isEmpty. Operand 6422 states and 23615 transitions. [2025-04-13 23:27:45,837 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:45,837 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:45,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:45,837 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2025-04-13 23:27:45,837 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 23:27:45,838 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:45,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1510437795, now seen corresponding path program 173 times [2025-04-13 23:27:45,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:45,838 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589979395] [2025-04-13 23:27:45,838 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:27:45,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:45,840 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:45,851 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:45,851 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:27:45,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:46,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:46,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:46,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589979395] [2025-04-13 23:27:46,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589979395] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:46,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:46,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:46,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832851541] [2025-04-13 23:27:46,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:46,455 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:46,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:46,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:46,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:46,455 INFO L87 Difference]: Start difference. First operand 6422 states and 23615 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:47,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:47,315 INFO L93 Difference]: Finished difference Result 12840 states and 45581 transitions. [2025-04-13 23:27:47,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:47,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 23:27:47,315 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:47,365 INFO L225 Difference]: With dead ends: 12840 [2025-04-13 23:27:47,365 INFO L226 Difference]: Without dead ends: 12769 [2025-04-13 23:27:47,370 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:27:47,370 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 303 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:47,370 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 100 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1472 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:27:47,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12769 states. [2025-04-13 23:27:47,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12769 to 6455. [2025-04-13 23:27:47,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6455 states, 6454 states have (on average 3.674930275797955) internal successors, (23718), 6454 states have internal predecessors, (23718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6455 states to 6455 states and 23718 transitions. [2025-04-13 23:27:47,553 INFO L79 Accepts]: Start accepts. Automaton has 6455 states and 23718 transitions. Word has length 54 [2025-04-13 23:27:47,553 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:47,553 INFO L485 AbstractCegarLoop]: Abstraction has 6455 states and 23718 transitions. [2025-04-13 23:27:47,553 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:47,553 INFO L278 IsEmpty]: Start isEmpty. Operand 6455 states and 23718 transitions. [2025-04-13 23:27:47,564 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:47,564 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:47,564 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:47,564 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2025-04-13 23:27:47,564 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 23:27:47,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:47,564 INFO L85 PathProgramCache]: Analyzing trace with hash -938458147, now seen corresponding path program 174 times [2025-04-13 23:27:47,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:47,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969510327] [2025-04-13 23:27:47,565 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:27:47,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:47,568 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:47,578 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:47,578 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:27:47,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:48,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:48,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:48,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969510327] [2025-04-13 23:27:48,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969510327] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:48,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:48,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:48,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822062676] [2025-04-13 23:27:48,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:48,193 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:48,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:48,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:48,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:48,193 INFO L87 Difference]: Start difference. First operand 6455 states and 23718 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:49,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:49,106 INFO L93 Difference]: Finished difference Result 11378 states and 40537 transitions. [2025-04-13 23:27:49,106 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:49,106 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:27:49,106 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:49,150 INFO L225 Difference]: With dead ends: 11378 [2025-04-13 23:27:49,150 INFO L226 Difference]: Without dead ends: 11261 [2025-04-13 23:27:49,154 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 23:27:49,154 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 272 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:49,154 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 119 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:27:49,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11261 states. [2025-04-13 23:27:49,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11261 to 6710. [2025-04-13 23:27:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6710 states, 6709 states have (on average 3.655686391414518) internal successors, (24526), 6709 states have internal predecessors, (24526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6710 states to 6710 states and 24526 transitions. [2025-04-13 23:27:49,308 INFO L79 Accepts]: Start accepts. Automaton has 6710 states and 24526 transitions. Word has length 54 [2025-04-13 23:27:49,308 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:49,308 INFO L485 AbstractCegarLoop]: Abstraction has 6710 states and 24526 transitions. [2025-04-13 23:27:49,308 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:49,308 INFO L278 IsEmpty]: Start isEmpty. Operand 6710 states and 24526 transitions. [2025-04-13 23:27:49,318 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:49,319 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:49,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 23:27:49,319 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2025-04-13 23:27:49,319 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 23:27:49,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:49,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1844394175, now seen corresponding path program 175 times [2025-04-13 23:27:49,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:49,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296944462] [2025-04-13 23:27:49,319 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:27:49,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:49,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:49,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:49,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:27:49,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:50,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:50,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296944462] [2025-04-13 23:27:50,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296944462] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:50,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:50,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:50,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505218826] [2025-04-13 23:27:50,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:50,022 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:50,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:50,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:50,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:50,022 INFO L87 Difference]: Start difference. First operand 6710 states and 24526 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:50,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:50,888 INFO L93 Difference]: Finished difference Result 13094 states and 46376 transitions. [2025-04-13 23:27:50,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:50,888 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:27:50,888 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:50,941 INFO L225 Difference]: With dead ends: 13094 [2025-04-13 23:27:50,941 INFO L226 Difference]: Without dead ends: 13013 [2025-04-13 23:27:50,946 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:27:50,947 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 317 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:50,947 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 81 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:27:50,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13013 states. [2025-04-13 23:27:51,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13013 to 6699. [2025-04-13 23:27:51,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6699 states, 6698 states have (on average 3.656016721409376) internal successors, (24488), 6698 states have internal predecessors, (24488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6699 states to 6699 states and 24488 transitions. [2025-04-13 23:27:51,128 INFO L79 Accepts]: Start accepts. Automaton has 6699 states and 24488 transitions. Word has length 54 [2025-04-13 23:27:51,128 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:51,128 INFO L485 AbstractCegarLoop]: Abstraction has 6699 states and 24488 transitions. [2025-04-13 23:27:51,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 23:27:51,129 INFO L278 IsEmpty]: Start isEmpty. Operand 6699 states and 24488 transitions. [2025-04-13 23:27:51,140 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:51,140 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:51,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:51,140 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2025-04-13 23:27:51,140 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 23:27:51,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:51,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1141087173, now seen corresponding path program 176 times [2025-04-13 23:27:51,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:51,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211324817] [2025-04-13 23:27:51,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:27:51,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:51,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:51,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:51,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:27:51,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:51,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:51,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211324817] [2025-04-13 23:27:51,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211324817] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:51,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:51,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:51,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289284264] [2025-04-13 23:27:51,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:51,742 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:51,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:51,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:51,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:51,742 INFO L87 Difference]: Start difference. First operand 6699 states and 24488 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:52,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:52,596 INFO L93 Difference]: Finished difference Result 11402 states and 40559 transitions. [2025-04-13 23:27:52,597 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:52,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 23:27:52,597 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:52,645 INFO L225 Difference]: With dead ends: 11402 [2025-04-13 23:27:52,645 INFO L226 Difference]: Without dead ends: 11331 [2025-04-13 23:27:52,649 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 23:27:52,649 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 281 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1509 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:52,649 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 119 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1509 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:27:52,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11331 states. [2025-04-13 23:27:52,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11331 to 6710. [2025-04-13 23:27:52,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6710 states, 6709 states have (on average 3.654046802802206) internal successors, (24515), 6709 states have internal predecessors, (24515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6710 states to 6710 states and 24515 transitions. [2025-04-13 23:27:52,849 INFO L79 Accepts]: Start accepts. Automaton has 6710 states and 24515 transitions. Word has length 54 [2025-04-13 23:27:52,850 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:52,850 INFO L485 AbstractCegarLoop]: Abstraction has 6710 states and 24515 transitions. [2025-04-13 23:27:52,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 23:27:52,850 INFO L278 IsEmpty]: Start isEmpty. Operand 6710 states and 24515 transitions. [2025-04-13 23:27:52,861 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:52,862 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:52,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:52,862 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2025-04-13 23:27:52,862 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 23:27:52,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:52,863 INFO L85 PathProgramCache]: Analyzing trace with hash -837006387, now seen corresponding path program 177 times [2025-04-13 23:27:52,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:52,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301222335] [2025-04-13 23:27:52,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:27:52,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:52,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:52,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:52,881 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:27:52,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:53,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:53,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301222335] [2025-04-13 23:27:53,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301222335] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:53,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:53,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:53,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869005928] [2025-04-13 23:27:53,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:53,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:53,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:53,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:53,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:53,446 INFO L87 Difference]: Start difference. First operand 6710 states and 24515 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:54,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:54,312 INFO L93 Difference]: Finished difference Result 13068 states and 46317 transitions. [2025-04-13 23:27:54,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:54,312 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:27:54,312 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:54,372 INFO L225 Difference]: With dead ends: 13068 [2025-04-13 23:27:54,372 INFO L226 Difference]: Without dead ends: 12932 [2025-04-13 23:27:54,378 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 23:27:54,378 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 284 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:54,378 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 98 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:27:54,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12932 states. [2025-04-13 23:27:54,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12932 to 6688. [2025-04-13 23:27:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6688 states, 6687 states have (on average 3.6548526992672348) internal successors, (24440), 6687 states have internal predecessors, (24440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:54,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6688 states to 6688 states and 24440 transitions. [2025-04-13 23:27:54,559 INFO L79 Accepts]: Start accepts. Automaton has 6688 states and 24440 transitions. Word has length 54 [2025-04-13 23:27:54,559 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:54,559 INFO L485 AbstractCegarLoop]: Abstraction has 6688 states and 24440 transitions. [2025-04-13 23:27:54,559 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:54,559 INFO L278 IsEmpty]: Start isEmpty. Operand 6688 states and 24440 transitions. [2025-04-13 23:27:54,570 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:54,570 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:54,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:54,570 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2025-04-13 23:27:54,570 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 23:27:54,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:54,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1619050151, now seen corresponding path program 178 times [2025-04-13 23:27:54,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:54,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363041452] [2025-04-13 23:27:54,571 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:27:54,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:54,573 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:27:54,587 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 23:27:54,587 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:27:54,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:55,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 23:27:55,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:55,226 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363041452] [2025-04-13 23:27:55,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363041452] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:55,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:55,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 23:27:55,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933840331] [2025-04-13 23:27:55,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:55,227 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:27:55,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:55,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:27:55,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:27:55,227 INFO L87 Difference]: Start difference. First operand 6688 states and 24440 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:56,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:56,450 INFO L93 Difference]: Finished difference Result 13045 states and 45840 transitions. [2025-04-13 23:27:56,450 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 23:27:56,450 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:27:56,450 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:56,502 INFO L225 Difference]: With dead ends: 13045 [2025-04-13 23:27:56,503 INFO L226 Difference]: Without dead ends: 12920 [2025-04-13 23:27:56,508 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=317, Invalid=675, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:27:56,508 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 367 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 1851 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:56,508 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 150 Invalid, 1882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1851 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:27:56,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12920 states. [2025-04-13 23:27:56,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12920 to 6655. [2025-04-13 23:27:56,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6655 states, 6654 states have (on average 3.6574992485722873) internal successors, (24337), 6654 states have internal predecessors, (24337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:56,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6655 states to 6655 states and 24337 transitions. [2025-04-13 23:27:56,691 INFO L79 Accepts]: Start accepts. Automaton has 6655 states and 24337 transitions. Word has length 54 [2025-04-13 23:27:56,691 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:56,691 INFO L485 AbstractCegarLoop]: Abstraction has 6655 states and 24337 transitions. [2025-04-13 23:27:56,691 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:56,691 INFO L278 IsEmpty]: Start isEmpty. Operand 6655 states and 24337 transitions. [2025-04-13 23:27:56,702 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:56,702 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:56,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 23:27:56,702 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2025-04-13 23:27:56,702 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 23:27:56,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:56,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1512045475, now seen corresponding path program 179 times [2025-04-13 23:27:56,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:56,703 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730216267] [2025-04-13 23:27:56,703 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:27:56,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:56,705 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:56,716 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:56,716 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:27:56,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:57,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:57,322 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730216267] [2025-04-13 23:27:57,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730216267] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:57,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:57,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:57,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286420811] [2025-04-13 23:27:57,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:57,322 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:57,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:57,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:57,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:57,323 INFO L87 Difference]: Start difference. First operand 6655 states and 24337 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:58,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:58,185 INFO L93 Difference]: Finished difference Result 12903 states and 45814 transitions. [2025-04-13 23:27:58,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:58,185 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:27:58,185 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:58,251 INFO L225 Difference]: With dead ends: 12903 [2025-04-13 23:27:58,251 INFO L226 Difference]: Without dead ends: 12835 [2025-04-13 23:27:58,258 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 23:27:58,258 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 288 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:27:58,258 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 98 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:27:58,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12835 states. [2025-04-13 23:27:58,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12835 to 6685. [2025-04-13 23:27:58,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6685 states, 6684 states have (on average 3.6552962298025133) internal successors, (24432), 6684 states have internal predecessors, (24432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6685 states to 6685 states and 24432 transitions. [2025-04-13 23:27:58,451 INFO L79 Accepts]: Start accepts. Automaton has 6685 states and 24432 transitions. Word has length 54 [2025-04-13 23:27:58,451 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:27:58,451 INFO L485 AbstractCegarLoop]: Abstraction has 6685 states and 24432 transitions. [2025-04-13 23:27:58,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 23:27:58,451 INFO L278 IsEmpty]: Start isEmpty. Operand 6685 states and 24432 transitions. [2025-04-13 23:27:58,462 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:27:58,462 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:27:58,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:27:58,463 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2025-04-13 23:27:58,463 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 23:27:58,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:27:58,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1086749667, now seen corresponding path program 180 times [2025-04-13 23:27:58,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:27:58,463 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147446850] [2025-04-13 23:27:58,463 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:27:58,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:27:58,466 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:27:58,477 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:27:58,477 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:27:58,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:27:59,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:27:59,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:27:59,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147446850] [2025-04-13 23:27:59,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147446850] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:27:59,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:27:59,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:27:59,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944247009] [2025-04-13 23:27:59,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:27:59,073 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:27:59,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:27:59,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:27:59,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:27:59,074 INFO L87 Difference]: Start difference. First operand 6685 states and 24432 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:27:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:27:59,952 INFO L93 Difference]: Finished difference Result 11328 states and 40350 transitions. [2025-04-13 23:27:59,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:27:59,952 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:27:59,952 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:27:59,999 INFO L225 Difference]: With dead ends: 11328 [2025-04-13 23:27:59,999 INFO L226 Difference]: Without dead ends: 11257 [2025-04-13 23:28:00,004 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 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 23:28:00,005 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 259 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:00,005 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 112 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1405 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:28:00,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11257 states. [2025-04-13 23:28:00,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11257 to 6718. [2025-04-13 23:28:00,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6718 states, 6717 states have (on average 3.652672323954146) internal successors, (24535), 6717 states have internal predecessors, (24535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6718 states to 6718 states and 24535 transitions. [2025-04-13 23:28:00,181 INFO L79 Accepts]: Start accepts. Automaton has 6718 states and 24535 transitions. Word has length 54 [2025-04-13 23:28:00,181 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:00,181 INFO L485 AbstractCegarLoop]: Abstraction has 6718 states and 24535 transitions. [2025-04-13 23:28:00,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 23:28:00,181 INFO L278 IsEmpty]: Start isEmpty. Operand 6718 states and 24535 transitions. [2025-04-13 23:28:00,192 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:00,192 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:00,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 23:28:00,193 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2025-04-13 23:28:00,193 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 23:28:00,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:00,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2012443839, now seen corresponding path program 181 times [2025-04-13 23:28:00,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:00,193 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727664668] [2025-04-13 23:28:00,193 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:28:00,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:00,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:00,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:00,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:28:00,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:00,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:00,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727664668] [2025-04-13 23:28:00,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727664668] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:00,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:00,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:00,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345658539] [2025-04-13 23:28:00,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:00,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:00,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:00,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:00,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:00,801 INFO L87 Difference]: Start difference. First operand 6718 states and 24535 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:01,740 INFO L93 Difference]: Finished difference Result 12938 states and 45912 transitions. [2025-04-13 23:28:01,740 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:01,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 23:28:01,741 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:01,795 INFO L225 Difference]: With dead ends: 12938 [2025-04-13 23:28:01,795 INFO L226 Difference]: Without dead ends: 12858 [2025-04-13 23:28:01,800 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:28:01,800 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 275 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:01,800 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 108 Invalid, 1610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:28:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12858 states. [2025-04-13 23:28:01,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12858 to 6708. [2025-04-13 23:28:01,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6708 states, 6707 states have (on average 3.652899955270613) internal successors, (24500), 6707 states have internal predecessors, (24500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:02,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6708 states to 6708 states and 24500 transitions. [2025-04-13 23:28:02,025 INFO L79 Accepts]: Start accepts. Automaton has 6708 states and 24500 transitions. Word has length 54 [2025-04-13 23:28:02,025 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:02,025 INFO L485 AbstractCegarLoop]: Abstraction has 6708 states and 24500 transitions. [2025-04-13 23:28:02,026 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:02,026 INFO L278 IsEmpty]: Start isEmpty. Operand 6708 states and 24500 transitions. [2025-04-13 23:28:02,036 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:02,037 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:02,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:28:02,037 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2025-04-13 23:28:02,037 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 23:28:02,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:02,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1673387657, now seen corresponding path program 182 times [2025-04-13 23:28:02,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:02,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910840192] [2025-04-13 23:28:02,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:28:02,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:02,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:02,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:02,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:28:02,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:02,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:02,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:02,662 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910840192] [2025-04-13 23:28:02,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910840192] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:02,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:02,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:02,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569191836] [2025-04-13 23:28:02,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:02,663 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:02,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:02,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:02,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:02,663 INFO L87 Difference]: Start difference. First operand 6708 states and 24500 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:03,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:03,657 INFO L93 Difference]: Finished difference Result 11317 states and 40302 transitions. [2025-04-13 23:28:03,657 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:03,657 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:28:03,657 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:03,708 INFO L225 Difference]: With dead ends: 11317 [2025-04-13 23:28:03,708 INFO L226 Difference]: Without dead ends: 11236 [2025-04-13 23:28:03,713 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:28:03,713 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 280 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:03,713 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 127 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:28:03,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11236 states. [2025-04-13 23:28:03,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11236 to 6697. [2025-04-13 23:28:03,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6697 states, 6696 states have (on average 3.653225806451613) internal successors, (24462), 6696 states have internal predecessors, (24462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:03,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6697 states to 6697 states and 24462 transitions. [2025-04-13 23:28:03,880 INFO L79 Accepts]: Start accepts. Automaton has 6697 states and 24462 transitions. Word has length 54 [2025-04-13 23:28:03,881 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:03,881 INFO L485 AbstractCegarLoop]: Abstraction has 6697 states and 24462 transitions. [2025-04-13 23:28:03,881 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:03,881 INFO L278 IsEmpty]: Start isEmpty. Operand 6697 states and 24462 transitions. [2025-04-13 23:28:03,892 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:03,892 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:03,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 23:28:03,892 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2025-04-13 23:28:03,892 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 23:28:03,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:03,893 INFO L85 PathProgramCache]: Analyzing trace with hash -674208275, now seen corresponding path program 183 times [2025-04-13 23:28:03,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:03,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285747154] [2025-04-13 23:28:03,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:28:03,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:03,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:03,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:03,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:28:03,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:04,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:04,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:04,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285747154] [2025-04-13 23:28:04,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285747154] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:04,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:04,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:04,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9710113] [2025-04-13 23:28:04,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:04,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:04,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:04,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:04,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:04,530 INFO L87 Difference]: Start difference. First operand 6697 states and 24462 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:05,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:05,396 INFO L93 Difference]: Finished difference Result 12891 states and 45791 transitions. [2025-04-13 23:28:05,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:05,397 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:28:05,397 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:05,448 INFO L225 Difference]: With dead ends: 12891 [2025-04-13 23:28:05,448 INFO L226 Difference]: Without dead ends: 12747 [2025-04-13 23:28:05,453 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 23:28:05,453 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 281 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:05,453 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 95 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:28:05,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12747 states. [2025-04-13 23:28:05,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12747 to 6667. [2025-04-13 23:28:05,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6667 states, 6666 states have (on average 3.6554155415541554) internal successors, (24367), 6666 states have internal predecessors, (24367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6667 states to 6667 states and 24367 transitions. [2025-04-13 23:28:05,636 INFO L79 Accepts]: Start accepts. Automaton has 6667 states and 24367 transitions. Word has length 54 [2025-04-13 23:28:05,636 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:05,636 INFO L485 AbstractCegarLoop]: Abstraction has 6667 states and 24367 transitions. [2025-04-13 23:28:05,636 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:05,636 INFO L278 IsEmpty]: Start isEmpty. Operand 6667 states and 24367 transitions. [2025-04-13 23:28:05,647 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:05,647 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:05,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:28:05,647 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2025-04-13 23:28:05,647 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 23:28:05,647 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:05,648 INFO L85 PathProgramCache]: Analyzing trace with hash 781212951, now seen corresponding path program 184 times [2025-04-13 23:28:05,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:05,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719421068] [2025-04-13 23:28:05,648 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:28:05,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:05,650 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:28:05,666 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 23:28:05,666 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:28:05,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:06,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 23:28:06,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:06,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719421068] [2025-04-13 23:28:06,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719421068] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:06,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:06,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:06,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173156585] [2025-04-13 23:28:06,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:06,266 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:06,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:06,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:06,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:06,267 INFO L87 Difference]: Start difference. First operand 6667 states and 24367 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:07,248 INFO L93 Difference]: Finished difference Result 11206 states and 39991 transitions. [2025-04-13 23:28:07,249 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:07,249 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:28:07,249 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:07,294 INFO L225 Difference]: With dead ends: 11206 [2025-04-13 23:28:07,295 INFO L226 Difference]: Without dead ends: 10927 [2025-04-13 23:28:07,298 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:28:07,299 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 246 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:07,299 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 145 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:28:07,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10927 states. [2025-04-13 23:28:07,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10927 to 6502. [2025-04-13 23:28:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6502 states, 6501 states have (on average 3.6694354714659285) internal successors, (23855), 6501 states have internal predecessors, (23855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6502 states to 6502 states and 23855 transitions. [2025-04-13 23:28:07,450 INFO L79 Accepts]: Start accepts. Automaton has 6502 states and 23855 transitions. Word has length 54 [2025-04-13 23:28:07,450 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:07,450 INFO L485 AbstractCegarLoop]: Abstraction has 6502 states and 23855 transitions. [2025-04-13 23:28:07,450 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:07,450 INFO L278 IsEmpty]: Start isEmpty. Operand 6502 states and 23855 transitions. [2025-04-13 23:28:07,460 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:07,460 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:07,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:28:07,460 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2025-04-13 23:28:07,460 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 23:28:07,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:07,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1017490541, now seen corresponding path program 185 times [2025-04-13 23:28:07,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:07,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515445405] [2025-04-13 23:28:07,461 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:28:07,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:07,463 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:07,474 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:07,474 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:28:07,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:08,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 23:28:08,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:08,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515445405] [2025-04-13 23:28:08,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515445405] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:08,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:08,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:08,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749071492] [2025-04-13 23:28:08,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:08,097 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:08,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:08,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:08,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:08,098 INFO L87 Difference]: Start difference. First operand 6502 states and 23855 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:09,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:09,026 INFO L93 Difference]: Finished difference Result 12587 states and 44850 transitions. [2025-04-13 23:28:09,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:09,027 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:28:09,027 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:09,076 INFO L225 Difference]: With dead ends: 12587 [2025-04-13 23:28:09,076 INFO L226 Difference]: Without dead ends: 12470 [2025-04-13 23:28:09,082 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:28:09,082 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 276 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 96 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 23:28:09,082 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 96 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:28:09,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12470 states. [2025-04-13 23:28:09,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12470 to 6601. [2025-04-13 23:28:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6601 states, 6600 states have (on average 3.6595454545454547) internal successors, (24153), 6600 states have internal predecessors, (24153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6601 states to 6601 states and 24153 transitions. [2025-04-13 23:28:09,245 INFO L79 Accepts]: Start accepts. Automaton has 6601 states and 24153 transitions. Word has length 54 [2025-04-13 23:28:09,245 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:09,245 INFO L485 AbstractCegarLoop]: Abstraction has 6601 states and 24153 transitions. [2025-04-13 23:28:09,245 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:09,245 INFO L278 IsEmpty]: Start isEmpty. Operand 6601 states and 24153 transitions. [2025-04-13 23:28:09,258 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:09,258 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:09,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 23:28:09,258 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2025-04-13 23:28:09,258 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 23:28:09,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:09,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2084614419, now seen corresponding path program 186 times [2025-04-13 23:28:09,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:09,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79951728] [2025-04-13 23:28:09,258 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:28:09,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:09,262 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:09,276 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:09,276 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:28:09,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:09,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:09,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:09,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79951728] [2025-04-13 23:28:09,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79951728] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:09,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:09,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:09,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103288960] [2025-04-13 23:28:09,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:09,830 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:09,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:09,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:09,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:09,830 INFO L87 Difference]: Start difference. First operand 6601 states and 24153 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:10,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:10,989 INFO L93 Difference]: Finished difference Result 11616 states and 41265 transitions. [2025-04-13 23:28:10,989 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:10,989 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:28:10,989 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:11,039 INFO L225 Difference]: With dead ends: 11616 [2025-04-13 23:28:11,039 INFO L226 Difference]: Without dead ends: 11548 [2025-04-13 23:28:11,043 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:28:11,044 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 294 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 1774 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:11,044 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 145 Invalid, 1791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1774 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:28:11,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11548 states. [2025-04-13 23:28:11,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11548 to 6676. [2025-04-13 23:28:11,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6676 states, 6675 states have (on average 3.65812734082397) internal successors, (24418), 6675 states have internal predecessors, (24418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:11,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6676 states to 6676 states and 24418 transitions. [2025-04-13 23:28:11,300 INFO L79 Accepts]: Start accepts. Automaton has 6676 states and 24418 transitions. Word has length 54 [2025-04-13 23:28:11,300 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:11,300 INFO L485 AbstractCegarLoop]: Abstraction has 6676 states and 24418 transitions. [2025-04-13 23:28:11,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 23:28:11,300 INFO L278 IsEmpty]: Start isEmpty. Operand 6676 states and 24418 transitions. [2025-04-13 23:28:11,314 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:11,314 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:11,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 23:28:11,315 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2025-04-13 23:28:11,315 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 23:28:11,315 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:11,315 INFO L85 PathProgramCache]: Analyzing trace with hash -417576949, now seen corresponding path program 187 times [2025-04-13 23:28:11,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:11,316 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576350076] [2025-04-13 23:28:11,316 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:28:11,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:11,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:11,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:11,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:28:11,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:11,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:11,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:11,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576350076] [2025-04-13 23:28:11,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576350076] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:11,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:11,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:11,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052214463] [2025-04-13 23:28:11,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:11,963 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:11,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:11,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:11,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:11,963 INFO L87 Difference]: Start difference. First operand 6676 states and 24418 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:12,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:12,784 INFO L93 Difference]: Finished difference Result 12697 states and 45175 transitions. [2025-04-13 23:28:12,785 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:12,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 23:28:12,785 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:12,837 INFO L225 Difference]: With dead ends: 12697 [2025-04-13 23:28:12,837 INFO L226 Difference]: Without dead ends: 12626 [2025-04-13 23:28:12,842 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:28:12,842 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 327 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1316 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:12,842 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 81 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1316 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:28:12,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12626 states. [2025-04-13 23:28:12,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12626 to 6687. [2025-04-13 23:28:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6687 states, 6686 states have (on average 3.6561471731977266) internal successors, (24445), 6686 states have internal predecessors, (24445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:12,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6687 states to 6687 states and 24445 transitions. [2025-04-13 23:28:13,001 INFO L79 Accepts]: Start accepts. Automaton has 6687 states and 24445 transitions. Word has length 54 [2025-04-13 23:28:13,001 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:13,001 INFO L485 AbstractCegarLoop]: Abstraction has 6687 states and 24445 transitions. [2025-04-13 23:28:13,001 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:13,001 INFO L278 IsEmpty]: Start isEmpty. Operand 6687 states and 24445 transitions. [2025-04-13 23:28:13,012 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:13,012 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:13,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 23:28:13,012 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2025-04-13 23:28:13,012 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 23:28:13,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:13,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1284609843, now seen corresponding path program 188 times [2025-04-13 23:28:13,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:13,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098233478] [2025-04-13 23:28:13,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:28:13,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:13,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:13,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:13,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:28:13,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:13,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 23:28:13,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:13,660 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098233478] [2025-04-13 23:28:13,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098233478] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:13,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:13,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:13,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204835546] [2025-04-13 23:28:13,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:13,661 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:13,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:13,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:13,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:13,661 INFO L87 Difference]: Start difference. First operand 6687 states and 24445 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:14,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:14,805 INFO L93 Difference]: Finished difference Result 11630 states and 41289 transitions. [2025-04-13 23:28:14,806 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:14,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 23:28:14,806 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:14,852 INFO L225 Difference]: With dead ends: 11630 [2025-04-13 23:28:14,852 INFO L226 Difference]: Without dead ends: 11549 [2025-04-13 23:28:14,856 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:28:14,856 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 274 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:14,856 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 149 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1794 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:28:14,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11549 states. [2025-04-13 23:28:14,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11549 to 6677. [2025-04-13 23:28:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6677 states, 6676 states have (on average 3.6563810665068903) internal successors, (24410), 6676 states have internal predecessors, (24410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:14,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6677 states to 6677 states and 24410 transitions. [2025-04-13 23:28:15,023 INFO L79 Accepts]: Start accepts. Automaton has 6677 states and 24410 transitions. Word has length 54 [2025-04-13 23:28:15,024 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:15,024 INFO L485 AbstractCegarLoop]: Abstraction has 6677 states and 24410 transitions. [2025-04-13 23:28:15,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:15,024 INFO L278 IsEmpty]: Start isEmpty. Operand 6677 states and 24410 transitions. [2025-04-13 23:28:15,035 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:15,035 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:15,035 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:28:15,035 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2025-04-13 23:28:15,035 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 23:28:15,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:15,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1357712275, now seen corresponding path program 189 times [2025-04-13 23:28:15,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:15,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547583049] [2025-04-13 23:28:15,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:28:15,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:15,038 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:15,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:15,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:28:15,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:15,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 23:28:15,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:15,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547583049] [2025-04-13 23:28:15,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547583049] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:15,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:15,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:15,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224059236] [2025-04-13 23:28:15,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:15,726 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:15,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:15,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:15,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:15,726 INFO L87 Difference]: Start difference. First operand 6677 states and 24410 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:16,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:16,577 INFO L93 Difference]: Finished difference Result 12616 states and 44949 transitions. [2025-04-13 23:28:16,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:16,578 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:28:16,578 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:16,637 INFO L225 Difference]: With dead ends: 12616 [2025-04-13 23:28:16,637 INFO L226 Difference]: Without dead ends: 12513 [2025-04-13 23:28:16,641 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:28:16,642 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 290 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:16,642 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 81 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:28:16,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12513 states. [2025-04-13 23:28:16,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12513 to 6644. [2025-04-13 23:28:16,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6644 states, 6643 states have (on average 3.6590395905464397) internal successors, (24307), 6643 states have internal predecessors, (24307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:16,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6644 states to 6644 states and 24307 transitions. [2025-04-13 23:28:16,811 INFO L79 Accepts]: Start accepts. Automaton has 6644 states and 24307 transitions. Word has length 54 [2025-04-13 23:28:16,811 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:16,811 INFO L485 AbstractCegarLoop]: Abstraction has 6644 states and 24307 transitions. [2025-04-13 23:28:16,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 23:28:16,811 INFO L278 IsEmpty]: Start isEmpty. Operand 6644 states and 24307 transitions. [2025-04-13 23:28:16,822 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:16,822 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:16,822 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:28:16,822 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2025-04-13 23:28:16,822 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 23:28:16,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:16,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1295993035, now seen corresponding path program 190 times [2025-04-13 23:28:16,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:16,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792570571] [2025-04-13 23:28:16,822 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:28:16,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:16,825 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:28:16,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 23:28:16,836 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:28:16,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:17,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:17,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:17,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792570571] [2025-04-13 23:28:17,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792570571] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:17,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:17,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 23:28:17,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965373373] [2025-04-13 23:28:17,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:17,516 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:28:17,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:17,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:28:17,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:28:17,517 INFO L87 Difference]: Start difference. First operand 6644 states and 24307 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:18,857 INFO L93 Difference]: Finished difference Result 13480 states and 47187 transitions. [2025-04-13 23:28:18,857 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 23:28:18,857 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:28:18,857 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:18,911 INFO L225 Difference]: With dead ends: 13480 [2025-04-13 23:28:18,911 INFO L226 Difference]: Without dead ends: 13277 [2025-04-13 23:28:18,916 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=328, Invalid=728, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:28:18,917 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 464 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 1854 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:18,917 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 150 Invalid, 1885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1854 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:28:18,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13277 states. [2025-04-13 23:28:19,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13277 to 6624. [2025-04-13 23:28:19,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6624 states, 6623 states have (on average 3.6595198550505814) internal successors, (24237), 6623 states have internal predecessors, (24237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:19,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6624 states to 6624 states and 24237 transitions. [2025-04-13 23:28:19,098 INFO L79 Accepts]: Start accepts. Automaton has 6624 states and 24237 transitions. Word has length 54 [2025-04-13 23:28:19,098 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:19,099 INFO L485 AbstractCegarLoop]: Abstraction has 6624 states and 24237 transitions. [2025-04-13 23:28:19,099 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:19,099 INFO L278 IsEmpty]: Start isEmpty. Operand 6624 states and 24237 transitions. [2025-04-13 23:28:19,110 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:19,110 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:19,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:28:19,110 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2025-04-13 23:28:19,110 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 23:28:19,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:19,110 INFO L85 PathProgramCache]: Analyzing trace with hash -336177893, now seen corresponding path program 191 times [2025-04-13 23:28:19,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:19,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779253878] [2025-04-13 23:28:19,110 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:28:19,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:19,113 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:19,124 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:19,124 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:28:19,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:19,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 23:28:19,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:19,737 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779253878] [2025-04-13 23:28:19,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779253878] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:19,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:19,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:19,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093402245] [2025-04-13 23:28:19,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:19,737 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:19,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:19,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:19,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:19,737 INFO L87 Difference]: Start difference. First operand 6624 states and 24237 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:20,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:20,630 INFO L93 Difference]: Finished difference Result 12607 states and 44917 transitions. [2025-04-13 23:28:20,630 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:20,630 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:28:20,630 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:20,675 INFO L225 Difference]: With dead ends: 12607 [2025-04-13 23:28:20,675 INFO L226 Difference]: Without dead ends: 12536 [2025-04-13 23:28:20,677 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 23:28:20,677 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 253 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:20,677 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 92 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1385 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:28:20,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12536 states. [2025-04-13 23:28:20,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12536 to 6657. [2025-04-13 23:28:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6657 states, 6656 states have (on average 3.6568509615384617) internal successors, (24340), 6656 states have internal predecessors, (24340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:20,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6657 states to 6657 states and 24340 transitions. [2025-04-13 23:28:20,820 INFO L79 Accepts]: Start accepts. Automaton has 6657 states and 24340 transitions. Word has length 54 [2025-04-13 23:28:20,820 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:20,820 INFO L485 AbstractCegarLoop]: Abstraction has 6657 states and 24340 transitions. [2025-04-13 23:28:20,820 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:20,820 INFO L278 IsEmpty]: Start isEmpty. Operand 6657 states and 24340 transitions. [2025-04-13 23:28:20,831 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:20,831 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:20,831 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:28:20,831 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2025-04-13 23:28:20,831 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 23:28:20,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:20,831 INFO L85 PathProgramCache]: Analyzing trace with hash -193756909, now seen corresponding path program 192 times [2025-04-13 23:28:20,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:20,831 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355227690] [2025-04-13 23:28:20,831 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:28:20,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:20,838 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:20,850 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:20,850 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:28:20,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:21,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:21,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:21,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355227690] [2025-04-13 23:28:21,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355227690] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:21,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:21,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:21,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339868473] [2025-04-13 23:28:21,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:21,451 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:21,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:21,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:21,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:21,451 INFO L87 Difference]: Start difference. First operand 6657 states and 24340 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:22,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:22,391 INFO L93 Difference]: Finished difference Result 11794 states and 41723 transitions. [2025-04-13 23:28:22,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:22,391 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:28:22,391 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:22,442 INFO L225 Difference]: With dead ends: 11794 [2025-04-13 23:28:22,442 INFO L226 Difference]: Without dead ends: 11726 [2025-04-13 23:28:22,446 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:28:22,446 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 356 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1612 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:22,447 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 127 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1612 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:28:22,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11726 states. [2025-04-13 23:28:22,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11726 to 6672. [2025-04-13 23:28:22,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6672 states, 6671 states have (on average 3.655374006895518) internal successors, (24385), 6671 states have internal predecessors, (24385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6672 states to 6672 states and 24385 transitions. [2025-04-13 23:28:22,617 INFO L79 Accepts]: Start accepts. Automaton has 6672 states and 24385 transitions. Word has length 54 [2025-04-13 23:28:22,617 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:22,617 INFO L485 AbstractCegarLoop]: Abstraction has 6672 states and 24385 transitions. [2025-04-13 23:28:22,618 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:22,618 INFO L278 IsEmpty]: Start isEmpty. Operand 6672 states and 24385 transitions. [2025-04-13 23:28:22,629 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:22,629 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:22,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:28:22,629 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2025-04-13 23:28:22,629 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 23:28:22,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:22,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1276313219, now seen corresponding path program 193 times [2025-04-13 23:28:22,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:22,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821852391] [2025-04-13 23:28:22,630 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:28:22,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:22,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:22,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:22,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:28:22,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:23,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:23,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821852391] [2025-04-13 23:28:23,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821852391] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:23,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:23,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:23,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044220408] [2025-04-13 23:28:23,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:23,316 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:23,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:23,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:23,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:23,317 INFO L87 Difference]: Start difference. First operand 6672 states and 24385 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:24,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:24,227 INFO L93 Difference]: Finished difference Result 12621 states and 44949 transitions. [2025-04-13 23:28:24,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:24,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 23:28:24,228 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:24,281 INFO L225 Difference]: With dead ends: 12621 [2025-04-13 23:28:24,281 INFO L226 Difference]: Without dead ends: 12540 [2025-04-13 23:28:24,288 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:28:24,288 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 277 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1487 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:24,288 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 99 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1487 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:28:24,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12540 states. [2025-04-13 23:28:24,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12540 to 6661. [2025-04-13 23:28:24,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 3.6557057057057056) internal successors, (24347), 6660 states have internal predecessors, (24347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:24,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 24347 transitions. [2025-04-13 23:28:24,472 INFO L79 Accepts]: Start accepts. Automaton has 6661 states and 24347 transitions. Word has length 54 [2025-04-13 23:28:24,472 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:24,472 INFO L485 AbstractCegarLoop]: Abstraction has 6661 states and 24347 transitions. [2025-04-13 23:28:24,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 23:28:24,472 INFO L278 IsEmpty]: Start isEmpty. Operand 6661 states and 24347 transitions. [2025-04-13 23:28:24,484 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:24,484 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:24,484 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:28:24,484 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2025-04-13 23:28:24,484 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 23:28:24,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:24,484 INFO L85 PathProgramCache]: Analyzing trace with hash -993761485, now seen corresponding path program 194 times [2025-04-13 23:28:24,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:24,484 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300221079] [2025-04-13 23:28:24,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:28:24,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:24,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:24,498 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:24,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:28:24,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:25,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:25,112 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300221079] [2025-04-13 23:28:25,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300221079] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:25,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:25,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:25,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166268103] [2025-04-13 23:28:25,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:25,113 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:25,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:25,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:25,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:25,113 INFO L87 Difference]: Start difference. First operand 6661 states and 24347 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:26,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:26,162 INFO L93 Difference]: Finished difference Result 11786 states and 41682 transitions. [2025-04-13 23:28:26,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:26,163 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:28:26,163 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:26,216 INFO L225 Difference]: With dead ends: 11786 [2025-04-13 23:28:26,216 INFO L226 Difference]: Without dead ends: 11705 [2025-04-13 23:28:26,220 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:28:26,220 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 332 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 1788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:26,220 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 145 Invalid, 1788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:28:26,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11705 states. [2025-04-13 23:28:26,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11705 to 6651. [2025-04-13 23:28:26,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6651 states, 6650 states have (on average 3.6566917293233083) internal successors, (24317), 6650 states have internal predecessors, (24317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6651 states to 6651 states and 24317 transitions. [2025-04-13 23:28:26,400 INFO L79 Accepts]: Start accepts. Automaton has 6651 states and 24317 transitions. Word has length 54 [2025-04-13 23:28:26,400 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:26,401 INFO L485 AbstractCegarLoop]: Abstraction has 6651 states and 24317 transitions. [2025-04-13 23:28:26,401 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:26,401 INFO L278 IsEmpty]: Start isEmpty. Operand 6651 states and 24317 transitions. [2025-04-13 23:28:26,412 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:26,412 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:26,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 23:28:26,413 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193 [2025-04-13 23:28:26,413 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 23:28:26,413 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:26,413 INFO L85 PathProgramCache]: Analyzing trace with hash 337253515, now seen corresponding path program 195 times [2025-04-13 23:28:26,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:26,413 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083197954] [2025-04-13 23:28:26,413 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:28:26,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:26,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:26,427 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:26,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:28:26,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:27,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 23:28:27,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:27,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083197954] [2025-04-13 23:28:27,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083197954] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:27,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:27,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:27,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9657551] [2025-04-13 23:28:27,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:27,071 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:27,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:27,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:27,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:27,071 INFO L87 Difference]: Start difference. First operand 6651 states and 24317 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:27,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:27,903 INFO L93 Difference]: Finished difference Result 12530 states and 44703 transitions. [2025-04-13 23:28:27,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:27,903 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:28:27,903 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:27,956 INFO L225 Difference]: With dead ends: 12530 [2025-04-13 23:28:27,956 INFO L226 Difference]: Without dead ends: 12282 [2025-04-13 23:28:27,961 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:28:27,962 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 232 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:27,962 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 84 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:28:27,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12282 states. [2025-04-13 23:28:28,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12282 to 6517. [2025-04-13 23:28:28,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6517 states, 6516 states have (on average 3.6655923879680787) internal successors, (23885), 6516 states have internal predecessors, (23885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6517 states to 6517 states and 23885 transitions. [2025-04-13 23:28:28,142 INFO L79 Accepts]: Start accepts. Automaton has 6517 states and 23885 transitions. Word has length 54 [2025-04-13 23:28:28,142 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:28,143 INFO L485 AbstractCegarLoop]: Abstraction has 6517 states and 23885 transitions. [2025-04-13 23:28:28,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 23:28:28,143 INFO L278 IsEmpty]: Start isEmpty. Operand 6517 states and 23885 transitions. [2025-04-13 23:28:28,154 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:28,154 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:28,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 23:28:28,154 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2025-04-13 23:28:28,154 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 23:28:28,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:28,154 INFO L85 PathProgramCache]: Analyzing trace with hash 726819057, now seen corresponding path program 196 times [2025-04-13 23:28:28,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:28,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002046469] [2025-04-13 23:28:28,154 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:28:28,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:28,157 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:28:28,169 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 23:28:28,169 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:28:28,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:28,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:28,776 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002046469] [2025-04-13 23:28:28,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002046469] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:28,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:28,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 23:28:28,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598415245] [2025-04-13 23:28:28,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:28,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:28:28,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:28,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:28:28,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:28:28,777 INFO L87 Difference]: Start difference. First operand 6517 states and 23885 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:29,963 INFO L93 Difference]: Finished difference Result 13329 states and 46671 transitions. [2025-04-13 23:28:29,963 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 23:28:29,963 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:28:29,963 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:30,015 INFO L225 Difference]: With dead ends: 13329 [2025-04-13 23:28:30,015 INFO L226 Difference]: Without dead ends: 13261 [2025-04-13 23:28:30,019 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2025-04-13 23:28:30,019 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 386 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 2083 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:30,019 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 172 Invalid, 2110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2083 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:28:30,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13261 states. [2025-04-13 23:28:30,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13261 to 6527. [2025-04-13 23:28:30,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6527 states, 6526 states have (on average 3.6638063132087035) internal successors, (23910), 6526 states have internal predecessors, (23910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:30,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6527 states to 6527 states and 23910 transitions. [2025-04-13 23:28:30,185 INFO L79 Accepts]: Start accepts. Automaton has 6527 states and 23910 transitions. Word has length 54 [2025-04-13 23:28:30,185 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:30,185 INFO L485 AbstractCegarLoop]: Abstraction has 6527 states and 23910 transitions. [2025-04-13 23:28:30,185 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:30,185 INFO L278 IsEmpty]: Start isEmpty. Operand 6527 states and 23910 transitions. [2025-04-13 23:28:30,196 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:30,196 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:30,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:28:30,196 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2025-04-13 23:28:30,196 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 23:28:30,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:30,197 INFO L85 PathProgramCache]: Analyzing trace with hash 50448091, now seen corresponding path program 197 times [2025-04-13 23:28:30,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:30,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836554482] [2025-04-13 23:28:30,197 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:28:30,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:30,199 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:30,211 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:30,212 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:28:30,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:30,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:30,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:30,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836554482] [2025-04-13 23:28:30,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836554482] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:30,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:30,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:30,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947722166] [2025-04-13 23:28:30,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:30,799 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:30,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:30,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:30,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:30,800 INFO L87 Difference]: Start difference. First operand 6527 states and 23910 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:31,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:31,650 INFO L93 Difference]: Finished difference Result 12609 states and 44863 transitions. [2025-04-13 23:28:31,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:31,651 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:28:31,651 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:31,706 INFO L225 Difference]: With dead ends: 12609 [2025-04-13 23:28:31,706 INFO L226 Difference]: Without dead ends: 12538 [2025-04-13 23:28:31,711 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 23:28:31,711 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 276 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:31,711 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 102 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:28:31,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12538 states. [2025-04-13 23:28:31,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12538 to 6587. [2025-04-13 23:28:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6587 states, 6586 states have (on average 3.6630731855450955) internal successors, (24125), 6586 states have internal predecessors, (24125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6587 states to 6587 states and 24125 transitions. [2025-04-13 23:28:31,874 INFO L79 Accepts]: Start accepts. Automaton has 6587 states and 24125 transitions. Word has length 54 [2025-04-13 23:28:31,874 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:31,874 INFO L485 AbstractCegarLoop]: Abstraction has 6587 states and 24125 transitions. [2025-04-13 23:28:31,874 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:31,874 INFO L278 IsEmpty]: Start isEmpty. Operand 6587 states and 24125 transitions. [2025-04-13 23:28:31,885 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:31,885 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:31,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:28:31,885 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2025-04-13 23:28:31,885 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 23:28:31,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:31,886 INFO L85 PathProgramCache]: Analyzing trace with hash -43658925, now seen corresponding path program 198 times [2025-04-13 23:28:31,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:31,886 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145964105] [2025-04-13 23:28:31,886 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:28:31,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:31,888 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:31,899 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:31,899 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:28:31,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:32,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:32,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:32,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145964105] [2025-04-13 23:28:32,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145964105] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:32,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:32,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:32,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953622936] [2025-04-13 23:28:32,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:32,517 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:32,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:32,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:32,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:32,517 INFO L87 Difference]: Start difference. First operand 6587 states and 24125 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:33,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:33,533 INFO L93 Difference]: Finished difference Result 11562 states and 41070 transitions. [2025-04-13 23:28:33,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:33,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 23:28:33,533 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:33,584 INFO L225 Difference]: With dead ends: 11562 [2025-04-13 23:28:33,584 INFO L226 Difference]: Without dead ends: 11482 [2025-04-13 23:28:33,588 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:28:33,588 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 270 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:33,588 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 138 Invalid, 1721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:28:33,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11482 states. [2025-04-13 23:28:33,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11482 to 6577. [2025-04-13 23:28:33,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6577 states, 6576 states have (on average 3.664081508515815) internal successors, (24095), 6576 states have internal predecessors, (24095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:33,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6577 states to 6577 states and 24095 transitions. [2025-04-13 23:28:33,757 INFO L79 Accepts]: Start accepts. Automaton has 6577 states and 24095 transitions. Word has length 54 [2025-04-13 23:28:33,758 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:33,758 INFO L485 AbstractCegarLoop]: Abstraction has 6577 states and 24095 transitions. [2025-04-13 23:28:33,758 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:33,758 INFO L278 IsEmpty]: Start isEmpty. Operand 6577 states and 24095 transitions. [2025-04-13 23:28:33,769 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:33,769 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:33,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 23:28:33,769 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197 [2025-04-13 23:28:33,769 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 23:28:33,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:33,770 INFO L85 PathProgramCache]: Analyzing trace with hash 850452667, now seen corresponding path program 199 times [2025-04-13 23:28:33,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:33,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846009150] [2025-04-13 23:28:33,770 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:28:33,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:33,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:33,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:33,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:28:33,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:34,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:34,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:34,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846009150] [2025-04-13 23:28:34,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846009150] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:34,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:34,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:34,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417317889] [2025-04-13 23:28:34,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:34,452 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:34,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:34,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:34,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:34,452 INFO L87 Difference]: Start difference. First operand 6577 states and 24095 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:35,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:35,455 INFO L93 Difference]: Finished difference Result 12596 states and 44816 transitions. [2025-04-13 23:28:35,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:28:35,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 23:28:35,456 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:35,510 INFO L225 Difference]: With dead ends: 12596 [2025-04-13 23:28:35,510 INFO L226 Difference]: Without dead ends: 12518 [2025-04-13 23:28:35,516 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=456, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:28:35,516 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 267 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 119 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 23:28:35,516 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 119 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:28:35,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12518 states. [2025-04-13 23:28:35,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12518 to 6567. [2025-04-13 23:28:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6567 states, 6566 states have (on average 3.6643314042034723) internal successors, (24060), 6566 states have internal predecessors, (24060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6567 states to 6567 states and 24060 transitions. [2025-04-13 23:28:35,692 INFO L79 Accepts]: Start accepts. Automaton has 6567 states and 24060 transitions. Word has length 54 [2025-04-13 23:28:35,693 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:35,693 INFO L485 AbstractCegarLoop]: Abstraction has 6567 states and 24060 transitions. [2025-04-13 23:28:35,693 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:35,693 INFO L278 IsEmpty]: Start isEmpty. Operand 6567 states and 24060 transitions. [2025-04-13 23:28:35,704 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:35,704 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:35,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 23:28:35,704 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198 [2025-04-13 23:28:35,704 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 23:28:35,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:35,704 INFO L85 PathProgramCache]: Analyzing trace with hash 891224849, now seen corresponding path program 200 times [2025-04-13 23:28:35,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:35,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396983453] [2025-04-13 23:28:35,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:28:35,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:35,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:35,717 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:35,718 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:28:35,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:36,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 23:28:36,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:36,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396983453] [2025-04-13 23:28:36,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396983453] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:36,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:36,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:36,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694547296] [2025-04-13 23:28:36,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:36,361 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:36,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:36,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:36,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:36,362 INFO L87 Difference]: Start difference. First operand 6567 states and 24060 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:37,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:37,374 INFO L93 Difference]: Finished difference Result 11624 states and 41223 transitions. [2025-04-13 23:28:37,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28: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 23:28:37,375 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:37,421 INFO L225 Difference]: With dead ends: 11624 [2025-04-13 23:28:37,421 INFO L226 Difference]: Without dead ends: 11553 [2025-04-13 23:28:37,424 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 23:28:37,425 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 293 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:37,425 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 135 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:28:37,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11553 states. [2025-04-13 23:28:37,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11553 to 6578. [2025-04-13 23:28:37,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6578 states, 6577 states have (on average 3.6623080431807815) internal successors, (24087), 6577 states have internal predecessors, (24087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:37,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6578 states to 6578 states and 24087 transitions. [2025-04-13 23:28:37,593 INFO L79 Accepts]: Start accepts. Automaton has 6578 states and 24087 transitions. Word has length 54 [2025-04-13 23:28:37,593 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:37,593 INFO L485 AbstractCegarLoop]: Abstraction has 6578 states and 24087 transitions. [2025-04-13 23:28:37,593 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:37,593 INFO L278 IsEmpty]: Start isEmpty. Operand 6578 states and 24087 transitions. [2025-04-13 23:28:37,606 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:37,606 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:37,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 23:28:37,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable199 [2025-04-13 23:28:37,606 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 23:28:37,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:37,606 INFO L85 PathProgramCache]: Analyzing trace with hash 625493245, now seen corresponding path program 201 times [2025-04-13 23:28:37,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:37,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76481120] [2025-04-13 23:28:37,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:28:37,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:37,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:37,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:37,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:28:37,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:38,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:38,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76481120] [2025-04-13 23:28:38,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76481120] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:38,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:38,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:38,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434765034] [2025-04-13 23:28:38,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:38,235 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:38,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:38,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:38,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:38,235 INFO L87 Difference]: Start difference. First operand 6578 states and 24087 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:39,195 INFO L93 Difference]: Finished difference Result 12637 states and 44928 transitions. [2025-04-13 23:28:39,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:28:39,196 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:28:39,196 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:39,247 INFO L225 Difference]: With dead ends: 12637 [2025-04-13 23:28:39,247 INFO L226 Difference]: Without dead ends: 12509 [2025-04-13 23:28:39,253 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:28:39,253 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 272 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:39,253 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 104 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:28:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12509 states. [2025-04-13 23:28:39,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12509 to 6558. [2025-04-13 23:28:39,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6558 states, 6557 states have (on average 3.6628031111788926) internal successors, (24017), 6557 states have internal predecessors, (24017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6558 states to 6558 states and 24017 transitions. [2025-04-13 23:28:39,425 INFO L79 Accepts]: Start accepts. Automaton has 6558 states and 24017 transitions. Word has length 54 [2025-04-13 23:28:39,426 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:39,426 INFO L485 AbstractCegarLoop]: Abstraction has 6558 states and 24017 transitions. [2025-04-13 23:28:39,426 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:39,426 INFO L278 IsEmpty]: Start isEmpty. Operand 6558 states and 24017 transitions. [2025-04-13 23:28:39,437 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:39,437 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:39,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:28:39,437 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2025-04-13 23:28:39,437 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 23:28:39,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:39,437 INFO L85 PathProgramCache]: Analyzing trace with hash -48910477, now seen corresponding path program 202 times [2025-04-13 23:28:39,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:39,437 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655323082] [2025-04-13 23:28:39,437 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:28:39,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:39,440 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:28:39,451 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 23:28:39,451 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:28:39,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:39,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:39,956 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655323082] [2025-04-13 23:28:39,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655323082] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:39,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:39,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:39,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240185403] [2025-04-13 23:28:39,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:39,956 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:39,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:39,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:39,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:39,957 INFO L87 Difference]: Start difference. First operand 6558 states and 24017 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:40,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:40,797 INFO L93 Difference]: Finished difference Result 11533 states and 40962 transitions. [2025-04-13 23:28:40,797 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:40,797 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:28:40,797 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:40,849 INFO L225 Difference]: With dead ends: 11533 [2025-04-13 23:28:40,849 INFO L226 Difference]: Without dead ends: 11447 [2025-04-13 23:28:40,853 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:28:40,853 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 319 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:40,853 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 122 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:28:40,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11447 states. [2025-04-13 23:28:40,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11447 to 6542. [2025-04-13 23:28:40,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6542 states, 6541 states have (on average 3.665341690872955) internal successors, (23975), 6541 states have internal predecessors, (23975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 23975 transitions. [2025-04-13 23:28:41,024 INFO L79 Accepts]: Start accepts. Automaton has 6542 states and 23975 transitions. Word has length 54 [2025-04-13 23:28:41,024 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:41,024 INFO L485 AbstractCegarLoop]: Abstraction has 6542 states and 23975 transitions. [2025-04-13 23:28:41,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:41,024 INFO L278 IsEmpty]: Start isEmpty. Operand 6542 states and 23975 transitions. [2025-04-13 23:28:41,035 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:41,035 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:41,035 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:28:41,035 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2025-04-13 23:28:41,036 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 23:28:41,036 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:41,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1655020803, now seen corresponding path program 203 times [2025-04-13 23:28:41,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:41,036 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596003562] [2025-04-13 23:28:41,036 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:28:41,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:41,039 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:41,049 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:41,049 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:28:41,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:41,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:41,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596003562] [2025-04-13 23:28:41,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596003562] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:41,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:41,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:41,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878240981] [2025-04-13 23:28:41,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:41,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:41,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:41,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:41,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:41,677 INFO L87 Difference]: Start difference. First operand 6542 states and 23975 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:42,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:42,639 INFO L93 Difference]: Finished difference Result 12761 states and 45249 transitions. [2025-04-13 23:28:42,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:42,639 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:28:42,639 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:42,696 INFO L225 Difference]: With dead ends: 12761 [2025-04-13 23:28:42,696 INFO L226 Difference]: Without dead ends: 12690 [2025-04-13 23:28:42,701 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:28:42,701 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 296 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:42,701 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 112 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:28:42,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12690 states. [2025-04-13 23:28:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12690 to 6557. [2025-04-13 23:28:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6557 states, 6556 states have (on average 3.6638194020744357) internal successors, (24020), 6556 states have internal predecessors, (24020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:42,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6557 states to 6557 states and 24020 transitions. [2025-04-13 23:28:42,879 INFO L79 Accepts]: Start accepts. Automaton has 6557 states and 24020 transitions. Word has length 54 [2025-04-13 23:28:42,879 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:42,879 INFO L485 AbstractCegarLoop]: Abstraction has 6557 states and 24020 transitions. [2025-04-13 23:28:42,879 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:42,879 INFO L278 IsEmpty]: Start isEmpty. Operand 6557 states and 24020 transitions. [2025-04-13 23:28:42,890 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:42,890 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:42,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:28:42,891 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable202 [2025-04-13 23:28:42,891 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 23:28:42,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:42,891 INFO L85 PathProgramCache]: Analyzing trace with hash 563056373, now seen corresponding path program 204 times [2025-04-13 23:28:42,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:42,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586296080] [2025-04-13 23:28:42,891 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:28:42,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:42,894 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:42,904 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:42,904 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:28:42,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:43,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:43,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586296080] [2025-04-13 23:28:43,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586296080] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:43,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:43,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:43,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205954698] [2025-04-13 23:28:43,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:43,532 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:43,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:43,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:43,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:43,532 INFO L87 Difference]: Start difference. First operand 6557 states and 24020 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:44,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:44,589 INFO L93 Difference]: Finished difference Result 11672 states and 41357 transitions. [2025-04-13 23:28:44,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:44,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 23:28:44,590 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:44,635 INFO L225 Difference]: With dead ends: 11672 [2025-04-13 23:28:44,636 INFO L226 Difference]: Without dead ends: 11555 [2025-04-13 23:28:44,640 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 23:28:44,640 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 277 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:44,640 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 149 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1821 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:28:44,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11555 states. [2025-04-13 23:28:44,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11555 to 6579. [2025-04-13 23:28:44,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6579 states, 6578 states have (on average 3.6597750076010946) internal successors, (24074), 6578 states have internal predecessors, (24074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6579 states to 6579 states and 24074 transitions. [2025-04-13 23:28:44,800 INFO L79 Accepts]: Start accepts. Automaton has 6579 states and 24074 transitions. Word has length 54 [2025-04-13 23:28:44,801 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:44,801 INFO L485 AbstractCegarLoop]: Abstraction has 6579 states and 24074 transitions. [2025-04-13 23:28:44,801 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:44,801 INFO L278 IsEmpty]: Start isEmpty. Operand 6579 states and 24074 transitions. [2025-04-13 23:28:44,811 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:44,811 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:44,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 23:28:44,812 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable203 [2025-04-13 23:28:44,812 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 23:28:44,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:44,812 INFO L85 PathProgramCache]: Analyzing trace with hash -855016227, now seen corresponding path program 205 times [2025-04-13 23:28:44,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:44,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722145941] [2025-04-13 23:28:44,812 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:28:44,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:44,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:44,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:44,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:28:44,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:45,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:45,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722145941] [2025-04-13 23:28:45,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722145941] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:45,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:45,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:45,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460393441] [2025-04-13 23:28:45,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:45,482 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:45,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:45,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:45,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:45,482 INFO L87 Difference]: Start difference. First operand 6579 states and 24074 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:46,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:46,461 INFO L93 Difference]: Finished difference Result 12780 states and 45286 transitions. [2025-04-13 23:28:46,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:46,461 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:28:46,461 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:46,512 INFO L225 Difference]: With dead ends: 12780 [2025-04-13 23:28:46,512 INFO L226 Difference]: Without dead ends: 12702 [2025-04-13 23:28:46,517 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:28:46,517 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 293 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:46,517 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 120 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:28:46,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12702 states. [2025-04-13 23:28:46,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12702 to 6569. [2025-04-13 23:28:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6569 states, 6568 states have (on average 3.6607795371498173) internal successors, (24044), 6568 states have internal predecessors, (24044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:46,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6569 states to 6569 states and 24044 transitions. [2025-04-13 23:28:46,688 INFO L79 Accepts]: Start accepts. Automaton has 6569 states and 24044 transitions. Word has length 54 [2025-04-13 23:28:46,688 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:46,688 INFO L485 AbstractCegarLoop]: Abstraction has 6569 states and 24044 transitions. [2025-04-13 23:28:46,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 23:28:46,688 INFO L278 IsEmpty]: Start isEmpty. Operand 6569 states and 24044 transitions. [2025-04-13 23:28:46,699 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:46,699 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:46,699 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:28:46,699 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204 [2025-04-13 23:28:46,699 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 23:28:46,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:46,699 INFO L85 PathProgramCache]: Analyzing trace with hash -872011117, now seen corresponding path program 206 times [2025-04-13 23:28:46,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:46,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669068119] [2025-04-13 23:28:46,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:28:46,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:46,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:46,713 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:46,713 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:28:46,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:47,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:47,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:47,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669068119] [2025-04-13 23:28:47,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669068119] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:47,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:47,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:47,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351651897] [2025-04-13 23:28:47,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:47,308 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:47,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:47,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:47,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:47,308 INFO L87 Difference]: Start difference. First operand 6569 states and 24044 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:48,372 INFO L93 Difference]: Finished difference Result 11626 states and 41207 transitions. [2025-04-13 23:28:48,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:48,373 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:28:48,373 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:48,468 INFO L225 Difference]: With dead ends: 11626 [2025-04-13 23:28:48,469 INFO L226 Difference]: Without dead ends: 11555 [2025-04-13 23:28:48,471 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:28:48,471 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 279 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:48,471 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 151 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:28:48,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11555 states. [2025-04-13 23:28:48,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11555 to 6580. [2025-04-13 23:28:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6580 states, 6579 states have (on average 3.658762729898161) internal successors, (24071), 6579 states have internal predecessors, (24071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:48,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6580 states to 6580 states and 24071 transitions. [2025-04-13 23:28:48,623 INFO L79 Accepts]: Start accepts. Automaton has 6580 states and 24071 transitions. Word has length 54 [2025-04-13 23:28:48,623 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:48,623 INFO L485 AbstractCegarLoop]: Abstraction has 6580 states and 24071 transitions. [2025-04-13 23:28:48,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 23:28:48,624 INFO L278 IsEmpty]: Start isEmpty. Operand 6580 states and 24071 transitions. [2025-04-13 23:28:48,635 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:48,635 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:48,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 23:28:48,636 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable205 [2025-04-13 23:28:48,636 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 23:28:48,636 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:48,636 INFO L85 PathProgramCache]: Analyzing trace with hash 229965531, now seen corresponding path program 207 times [2025-04-13 23:28:48,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:48,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439538947] [2025-04-13 23:28:48,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:28:48,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:48,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:48,652 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:48,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:28:48,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:49,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 23:28:49,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:49,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439538947] [2025-04-13 23:28:49,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439538947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:49,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:49,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:49,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025741882] [2025-04-13 23:28:49,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:49,257 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:49,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:49,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:49,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:49,257 INFO L87 Difference]: Start difference. First operand 6580 states and 24071 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:50,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:50,128 INFO L93 Difference]: Finished difference Result 12693 states and 45050 transitions. [2025-04-13 23:28:50,128 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:50,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 23:28:50,129 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:50,185 INFO L225 Difference]: With dead ends: 12693 [2025-04-13 23:28:50,185 INFO L226 Difference]: Without dead ends: 12622 [2025-04-13 23:28:50,190 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:28:50,190 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 302 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:50,191 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 86 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:28:50,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12622 states. [2025-04-13 23:28:50,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12622 to 6580. [2025-04-13 23:28:50,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6580 states, 6579 states have (on average 3.658762729898161) internal successors, (24071), 6579 states have internal predecessors, (24071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:50,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6580 states to 6580 states and 24071 transitions. [2025-04-13 23:28:50,368 INFO L79 Accepts]: Start accepts. Automaton has 6580 states and 24071 transitions. Word has length 54 [2025-04-13 23:28:50,368 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:50,368 INFO L485 AbstractCegarLoop]: Abstraction has 6580 states and 24071 transitions. [2025-04-13 23:28:50,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 23:28:50,368 INFO L278 IsEmpty]: Start isEmpty. Operand 6580 states and 24071 transitions. [2025-04-13 23:28:50,379 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:50,380 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:50,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 23:28:50,380 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2025-04-13 23:28:50,380 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 23:28:50,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:50,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1812146443, now seen corresponding path program 208 times [2025-04-13 23:28:50,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:50,380 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310062616] [2025-04-13 23:28:50,380 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:28:50,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:50,383 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:28:50,396 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 23:28:50,396 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:28:50,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:51,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 23:28:51,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:51,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310062616] [2025-04-13 23:28:51,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310062616] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:51,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:51,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:51,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585426231] [2025-04-13 23:28:51,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:51,049 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:51,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:51,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:51,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:51,049 INFO L87 Difference]: Start difference. First operand 6580 states and 24071 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:51,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:51,989 INFO L93 Difference]: Finished difference Result 11566 states and 41043 transitions. [2025-04-13 23:28:51,989 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:51,990 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:28:51,990 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:52,036 INFO L225 Difference]: With dead ends: 11566 [2025-04-13 23:28:52,036 INFO L226 Difference]: Without dead ends: 11453 [2025-04-13 23:28:52,040 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:28:52,040 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 301 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:52,040 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 116 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:28:52,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11453 states. [2025-04-13 23:28:52,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11453 to 6548. [2025-04-13 23:28:52,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6548 states, 6547 states have (on average 3.6630517794409654) internal successors, (23982), 6547 states have internal predecessors, (23982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6548 states to 6548 states and 23982 transitions. [2025-04-13 23:28:52,201 INFO L79 Accepts]: Start accepts. Automaton has 6548 states and 23982 transitions. Word has length 54 [2025-04-13 23:28:52,201 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:52,201 INFO L485 AbstractCegarLoop]: Abstraction has 6548 states and 23982 transitions. [2025-04-13 23:28:52,201 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:52,202 INFO L278 IsEmpty]: Start isEmpty. Operand 6548 states and 23982 transitions. [2025-04-13 23:28:52,213 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:52,213 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:52,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:28:52,213 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2025-04-13 23:28:52,213 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 23:28:52,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:52,213 INFO L85 PathProgramCache]: Analyzing trace with hash -710169795, now seen corresponding path program 209 times [2025-04-13 23:28:52,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:52,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447722451] [2025-04-13 23:28:52,213 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:28:52,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:52,216 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:52,226 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:52,226 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:28:52,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:52,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:52,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447722451] [2025-04-13 23:28:52,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447722451] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:52,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:52,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:52,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877911058] [2025-04-13 23:28:52,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:52,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:52,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:52,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:52,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:52,871 INFO L87 Difference]: Start difference. First operand 6548 states and 23982 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:53,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:53,754 INFO L93 Difference]: Finished difference Result 12601 states and 44808 transitions. [2025-04-13 23:28:53,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:53,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 23:28:53,754 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:53,810 INFO L225 Difference]: With dead ends: 12601 [2025-04-13 23:28:53,810 INFO L226 Difference]: Without dead ends: 12520 [2025-04-13 23:28:53,816 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:28:53,816 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 285 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:53,816 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 84 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:28:53,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12520 states. [2025-04-13 23:28:53,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12520 to 6537. [2025-04-13 23:28:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6537 states, 6536 states have (on average 3.6643206854345167) internal successors, (23950), 6536 states have internal predecessors, (23950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6537 states to 6537 states and 23950 transitions. [2025-04-13 23:28:53,996 INFO L79 Accepts]: Start accepts. Automaton has 6537 states and 23950 transitions. Word has length 54 [2025-04-13 23:28:53,996 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:53,996 INFO L485 AbstractCegarLoop]: Abstraction has 6537 states and 23950 transitions. [2025-04-13 23:28:53,996 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:53,996 INFO L278 IsEmpty]: Start isEmpty. Operand 6537 states and 23950 transitions. [2025-04-13 23:28:54,007 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:54,007 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:54,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:28:54,007 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208 [2025-04-13 23:28:54,007 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 23:28:54,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:54,008 INFO L85 PathProgramCache]: Analyzing trace with hash -627786255, now seen corresponding path program 210 times [2025-04-13 23:28:54,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:54,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915363974] [2025-04-13 23:28:54,008 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:28:54,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:54,010 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:54,021 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:54,022 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:28:54,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:54,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:54,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915363974] [2025-04-13 23:28:54,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915363974] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:54,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:54,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:54,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518334026] [2025-04-13 23:28:54,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:54,671 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:54,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:54,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:54,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:54,671 INFO L87 Difference]: Start difference. First operand 6537 states and 23950 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:55,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:55,734 INFO L93 Difference]: Finished difference Result 11622 states and 41203 transitions. [2025-04-13 23:28:55,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:28:55,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 23:28:55,735 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:55,783 INFO L225 Difference]: With dead ends: 11622 [2025-04-13 23:28:55,784 INFO L226 Difference]: Without dead ends: 11554 [2025-04-13 23:28:55,788 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:28:55,788 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 274 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:55,788 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 156 Invalid, 1906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1889 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:28:55,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11554 states. [2025-04-13 23:28:55,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11554 to 6562. [2025-04-13 23:28:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6562 states, 6561 states have (on average 3.6633135192805977) internal successors, (24035), 6561 states have internal predecessors, (24035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:55,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6562 states to 6562 states and 24035 transitions. [2025-04-13 23:28:55,947 INFO L79 Accepts]: Start accepts. Automaton has 6562 states and 24035 transitions. Word has length 54 [2025-04-13 23:28:55,947 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:55,947 INFO L485 AbstractCegarLoop]: Abstraction has 6562 states and 24035 transitions. [2025-04-13 23:28:55,947 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:55,947 INFO L278 IsEmpty]: Start isEmpty. Operand 6562 states and 24035 transitions. [2025-04-13 23:28:55,958 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:55,958 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:55,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:28:55,958 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable209 [2025-04-13 23:28:55,958 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 23:28:55,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:55,958 INFO L85 PathProgramCache]: Analyzing trace with hash 65559739, now seen corresponding path program 211 times [2025-04-13 23:28:55,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:55,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830878174] [2025-04-13 23:28:55,958 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:28:55,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:55,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:55,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:55,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:28:55,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:56,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 23:28:56,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:56,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830878174] [2025-04-13 23:28:56,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830878174] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:56,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:56,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:56,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469592015] [2025-04-13 23:28:56,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:56,606 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:56,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:56,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:56,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:56,606 INFO L87 Difference]: Start difference. First operand 6562 states and 24035 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:57,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:57,529 INFO L93 Difference]: Finished difference Result 12693 states and 45069 transitions. [2025-04-13 23:28:57,529 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:57,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 23:28:57,529 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:57,630 INFO L225 Difference]: With dead ends: 12693 [2025-04-13 23:28:57,630 INFO L226 Difference]: Without dead ends: 12625 [2025-04-13 23:28:57,633 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:28:57,633 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 293 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:57,633 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 101 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:28:57,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12625 states. [2025-04-13 23:28:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12625 to 6572. [2025-04-13 23:28:57,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6572 states, 6571 states have (on average 3.661543144118095) internal successors, (24060), 6571 states have internal predecessors, (24060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6572 states to 6572 states and 24060 transitions. [2025-04-13 23:28:57,777 INFO L79 Accepts]: Start accepts. Automaton has 6572 states and 24060 transitions. Word has length 54 [2025-04-13 23:28:57,778 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:57,778 INFO L485 AbstractCegarLoop]: Abstraction has 6572 states and 24060 transitions. [2025-04-13 23:28:57,778 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:57,778 INFO L278 IsEmpty]: Start isEmpty. Operand 6572 states and 24060 transitions. [2025-04-13 23:28:57,788 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:57,789 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:57,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 23:28:57,789 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210 [2025-04-13 23:28:57,789 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 23:28:57,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:57,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1427790831, now seen corresponding path program 212 times [2025-04-13 23:28:57,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:57,790 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768802741] [2025-04-13 23:28:57,790 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:28:57,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:57,792 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:57,803 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:57,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:28:57,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:28:58,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:28:58,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:28:58,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768802741] [2025-04-13 23:28:58,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768802741] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:28:58,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:28:58,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:28:58,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401816490] [2025-04-13 23:28:58,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:28:58,437 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:28:58,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:28:58,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:28:58,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:28:58,437 INFO L87 Difference]: Start difference. First operand 6572 states and 24060 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:59,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:28:59,485 INFO L93 Difference]: Finished difference Result 11635 states and 41225 transitions. [2025-04-13 23:28:59,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:28:59,485 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:28:59,486 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:28:59,537 INFO L225 Difference]: With dead ends: 11635 [2025-04-13 23:28:59,537 INFO L226 Difference]: Without dead ends: 11554 [2025-04-13 23:28:59,541 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:28:59,541 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 304 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1786 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:28:59,541 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 144 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1786 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:28:59,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11554 states. [2025-04-13 23:28:59,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11554 to 6562. [2025-04-13 23:28:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6562 states, 6561 states have (on average 3.662551440329218) internal successors, (24030), 6561 states have internal predecessors, (24030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:28:59,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6562 states to 6562 states and 24030 transitions. [2025-04-13 23:28:59,706 INFO L79 Accepts]: Start accepts. Automaton has 6562 states and 24030 transitions. Word has length 54 [2025-04-13 23:28:59,707 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:28:59,707 INFO L485 AbstractCegarLoop]: Abstraction has 6562 states and 24030 transitions. [2025-04-13 23:28:59,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 23:28:59,707 INFO L278 IsEmpty]: Start isEmpty. Operand 6562 states and 24030 transitions. [2025-04-13 23:28:59,717 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:28:59,718 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:28:59,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 23:28:59,718 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211 [2025-04-13 23:28:59,718 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 23:28:59,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:28:59,718 INFO L85 PathProgramCache]: Analyzing trace with hash -704918243, now seen corresponding path program 213 times [2025-04-13 23:28:59,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:28:59,718 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554784509] [2025-04-13 23:28:59,718 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:28:59,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:28:59,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:28:59,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:28:59,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:28:59,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:00,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 23:29:00,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:00,409 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554784509] [2025-04-13 23:29:00,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554784509] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:00,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:00,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:00,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753626108] [2025-04-13 23:29:00,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:00,409 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:00,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:00,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:00,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:00,409 INFO L87 Difference]: Start difference. First operand 6562 states and 24030 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:01,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:01,312 INFO L93 Difference]: Finished difference Result 12615 states and 44856 transitions. [2025-04-13 23:29:01,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:01,312 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:01,312 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:01,365 INFO L225 Difference]: With dead ends: 12615 [2025-04-13 23:29:01,365 INFO L226 Difference]: Without dead ends: 12530 [2025-04-13 23:29:01,370 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:29:01,370 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 276 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:01,370 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 92 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:29:01,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12530 states. [2025-04-13 23:29:01,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12530 to 6547. [2025-04-13 23:29:01,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6547 states, 6546 states have (on average 3.664833486098381) internal successors, (23990), 6546 states have internal predecessors, (23990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6547 states to 6547 states and 23990 transitions. [2025-04-13 23:29:01,549 INFO L79 Accepts]: Start accepts. Automaton has 6547 states and 23990 transitions. Word has length 54 [2025-04-13 23:29:01,550 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:01,550 INFO L485 AbstractCegarLoop]: Abstraction has 6547 states and 23990 transitions. [2025-04-13 23:29:01,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:01,550 INFO L278 IsEmpty]: Start isEmpty. Operand 6547 states and 23990 transitions. [2025-04-13 23:29:01,561 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:01,561 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:01,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:01,561 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable212 [2025-04-13 23:29:01,561 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 23:29:01,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:01,561 INFO L85 PathProgramCache]: Analyzing trace with hash 292789711, now seen corresponding path program 214 times [2025-04-13 23:29:01,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:01,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88521575] [2025-04-13 23:29:01,561 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:29:01,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:01,564 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:29:01,576 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 23:29:01,576 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:29:01,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:02,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:02,165 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88521575] [2025-04-13 23:29:02,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88521575] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:02,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:02,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 23:29:02,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035141335] [2025-04-13 23:29:02,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:02,165 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:29:02,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:02,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:29:02,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:29:02,166 INFO L87 Difference]: Start difference. First operand 6547 states and 23990 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:03,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:03,274 INFO L93 Difference]: Finished difference Result 13458 states and 47019 transitions. [2025-04-13 23:29:03,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:29:03,274 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:03,274 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:03,328 INFO L225 Difference]: With dead ends: 13458 [2025-04-13 23:29:03,328 INFO L226 Difference]: Without dead ends: 13390 [2025-04-13 23:29:03,334 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=607, Unknown=0, NotChecked=0, Total=870 [2025-04-13 23:29:03,334 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 407 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2052 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 2078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:03,334 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 166 Invalid, 2078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2052 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:29:03,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13390 states. [2025-04-13 23:29:03,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13390 to 6557. [2025-04-13 23:29:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6557 states, 6556 states have (on average 3.663056741915802) internal successors, (24015), 6556 states have internal predecessors, (24015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6557 states to 6557 states and 24015 transitions. [2025-04-13 23:29:03,516 INFO L79 Accepts]: Start accepts. Automaton has 6557 states and 24015 transitions. Word has length 54 [2025-04-13 23:29:03,516 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:03,516 INFO L485 AbstractCegarLoop]: Abstraction has 6557 states and 24015 transitions. [2025-04-13 23:29:03,516 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:03,516 INFO L278 IsEmpty]: Start isEmpty. Operand 6557 states and 24015 transitions. [2025-04-13 23:29:03,527 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:03,527 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:03,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 23:29:03,527 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable213 [2025-04-13 23:29:03,527 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 23:29:03,527 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:03,527 INFO L85 PathProgramCache]: Analyzing trace with hash -901422881, now seen corresponding path program 215 times [2025-04-13 23:29:03,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:03,527 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403143115] [2025-04-13 23:29:03,527 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:29:03,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:03,530 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:03,540 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:03,540 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:29:03,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:04,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:04,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:04,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403143115] [2025-04-13 23:29:04,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403143115] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:04,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:04,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:04,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021892025] [2025-04-13 23:29:04,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:04,201 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:04,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:04,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:04,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:04,202 INFO L87 Difference]: Start difference. First operand 6557 states and 24015 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:05,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:05,205 INFO L93 Difference]: Finished difference Result 12736 states and 45199 transitions. [2025-04-13 23:29:05,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:29:05,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 23:29:05,205 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:05,260 INFO L225 Difference]: With dead ends: 12736 [2025-04-13 23:29:05,260 INFO L226 Difference]: Without dead ends: 12628 [2025-04-13 23:29:05,265 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:29:05,265 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 265 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:05,265 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 124 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:29:05,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12628 states. [2025-04-13 23:29:05,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12628 to 6577. [2025-04-13 23:29:05,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6577 states, 6576 states have (on average 3.6595194647201947) internal successors, (24065), 6576 states have internal predecessors, (24065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:05,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6577 states to 6577 states and 24065 transitions. [2025-04-13 23:29:05,446 INFO L79 Accepts]: Start accepts. Automaton has 6577 states and 24065 transitions. Word has length 54 [2025-04-13 23:29:05,446 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:05,446 INFO L485 AbstractCegarLoop]: Abstraction has 6577 states and 24065 transitions. [2025-04-13 23:29:05,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 23:29:05,446 INFO L278 IsEmpty]: Start isEmpty. Operand 6577 states and 24065 transitions. [2025-04-13 23:29:05,457 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:05,457 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:05,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 23:29:05,457 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable214 [2025-04-13 23:29:05,457 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 23:29:05,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:05,458 INFO L85 PathProgramCache]: Analyzing trace with hash -477688271, now seen corresponding path program 216 times [2025-04-13 23:29:05,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:05,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473506269] [2025-04-13 23:29:05,458 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:29:05,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:05,461 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:05,473 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:05,473 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:29:05,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:06,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:06,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:06,059 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473506269] [2025-04-13 23:29:06,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473506269] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:06,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:06,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:06,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117158434] [2025-04-13 23:29:06,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:06,059 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:06,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:06,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:06,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:06,060 INFO L87 Difference]: Start difference. First operand 6577 states and 24065 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:07,097 INFO L93 Difference]: Finished difference Result 11661 states and 41293 transitions. [2025-04-13 23:29:07,097 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:07,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 23:29:07,097 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:07,143 INFO L225 Difference]: With dead ends: 11661 [2025-04-13 23:29:07,143 INFO L226 Difference]: Without dead ends: 11581 [2025-04-13 23:29:07,145 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:29:07,145 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 294 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:07,145 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 131 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:29:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11581 states. [2025-04-13 23:29:07,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11581 to 6567. [2025-04-13 23:29:07,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6567 states, 6566 states have (on average 3.66052391105696) internal successors, (24035), 6566 states have internal predecessors, (24035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6567 states to 6567 states and 24035 transitions. [2025-04-13 23:29:07,299 INFO L79 Accepts]: Start accepts. Automaton has 6567 states and 24035 transitions. Word has length 54 [2025-04-13 23:29:07,299 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:07,299 INFO L485 AbstractCegarLoop]: Abstraction has 6567 states and 24035 transitions. [2025-04-13 23:29:07,299 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:07,299 INFO L278 IsEmpty]: Start isEmpty. Operand 6567 states and 24035 transitions. [2025-04-13 23:29:07,310 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:07,310 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:07,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:07,310 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable215 [2025-04-13 23:29:07,310 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 23:29:07,310 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:07,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1372080003, now seen corresponding path program 217 times [2025-04-13 23:29:07,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:07,310 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468108907] [2025-04-13 23:29:07,310 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:29:07,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:07,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:07,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:07,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:29:07,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:08,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:08,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:08,011 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468108907] [2025-04-13 23:29:08,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468108907] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:08,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:08,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:08,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152468199] [2025-04-13 23:29:08,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:08,011 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:08,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:08,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:08,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:08,011 INFO L87 Difference]: Start difference. First operand 6567 states and 24035 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:09,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:09,015 INFO L93 Difference]: Finished difference Result 12698 states and 45069 transitions. [2025-04-13 23:29:09,015 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:29:09,015 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:09,015 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:09,072 INFO L225 Difference]: With dead ends: 12698 [2025-04-13 23:29:09,072 INFO L226 Difference]: Without dead ends: 12630 [2025-04-13 23:29:09,076 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:29:09,077 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 276 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 1730 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:09,077 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 130 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1730 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:29:09,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12630 states. [2025-04-13 23:29:09,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12630 to 6577. [2025-04-13 23:29:09,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6577 states, 6576 states have (on average 3.658759124087591) internal successors, (24060), 6576 states have internal predecessors, (24060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6577 states to 6577 states and 24060 transitions. [2025-04-13 23:29:09,269 INFO L79 Accepts]: Start accepts. Automaton has 6577 states and 24060 transitions. Word has length 54 [2025-04-13 23:29:09,269 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:09,269 INFO L485 AbstractCegarLoop]: Abstraction has 6577 states and 24060 transitions. [2025-04-13 23:29:09,269 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:09,270 INFO L278 IsEmpty]: Start isEmpty. Operand 6577 states and 24060 transitions. [2025-04-13 23:29:09,280 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:09,280 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:09,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 23:29:09,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable216 [2025-04-13 23:29:09,280 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 23:29:09,281 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:09,281 INFO L85 PathProgramCache]: Analyzing trace with hash 457195503, now seen corresponding path program 218 times [2025-04-13 23:29:09,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:09,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985202426] [2025-04-13 23:29:09,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:29:09,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:09,284 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:09,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:09,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:29:09,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:09,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 23:29:09,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:09,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985202426] [2025-04-13 23:29:09,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985202426] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:09,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:09,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:09,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118303451] [2025-04-13 23:29:09,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:09,882 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:09,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:09,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:09,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:09,882 INFO L87 Difference]: Start difference. First operand 6577 states and 24060 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:10,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:10,744 INFO L93 Difference]: Finished difference Result 11721 states and 41441 transitions. [2025-04-13 23:29:10,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:10,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 23:29:10,745 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:10,797 INFO L225 Difference]: With dead ends: 11721 [2025-04-13 23:29:10,797 INFO L226 Difference]: Without dead ends: 11650 [2025-04-13 23:29:10,801 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:29:10,801 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 382 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:10,801 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 101 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:29:10,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11650 states. [2025-04-13 23:29:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11650 to 6588. [2025-04-13 23:29:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6588 states, 6587 states have (on average 3.656748140276302) internal successors, (24087), 6587 states have internal predecessors, (24087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6588 states to 6588 states and 24087 transitions. [2025-04-13 23:29:10,971 INFO L79 Accepts]: Start accepts. Automaton has 6588 states and 24087 transitions. Word has length 54 [2025-04-13 23:29:10,971 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:10,971 INFO L485 AbstractCegarLoop]: Abstraction has 6588 states and 24087 transitions. [2025-04-13 23:29:10,971 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:10,971 INFO L278 IsEmpty]: Start isEmpty. Operand 6588 states and 24087 transitions. [2025-04-13 23:29:10,982 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:10,982 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:10,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:10,983 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable217 [2025-04-13 23:29:10,983 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 23:29:10,983 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:10,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2142557985, now seen corresponding path program 219 times [2025-04-13 23:29:10,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:10,983 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465029037] [2025-04-13 23:29:10,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:29:10,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:10,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:10,996 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:10,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:29:10,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:11,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:11,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465029037] [2025-04-13 23:29:11,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465029037] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:11,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:11,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:11,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204018204] [2025-04-13 23:29:11,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:11,658 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:11,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:11,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:11,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:11,658 INFO L87 Difference]: Start difference. First operand 6588 states and 24087 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:12,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:12,589 INFO L93 Difference]: Finished difference Result 12641 states and 44913 transitions. [2025-04-13 23:29:12,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:12,589 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:12,590 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:12,642 INFO L225 Difference]: With dead ends: 12641 [2025-04-13 23:29:12,643 INFO L226 Difference]: Without dead ends: 12531 [2025-04-13 23:29:12,648 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:29:12,648 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 279 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:12,648 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 101 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1452 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:29:12,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12531 states. [2025-04-13 23:29:12,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12531 to 6548. [2025-04-13 23:29:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6548 states, 6547 states have (on average 3.662288070872155) internal successors, (23977), 6547 states have internal predecessors, (23977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6548 states to 6548 states and 23977 transitions. [2025-04-13 23:29:12,821 INFO L79 Accepts]: Start accepts. Automaton has 6548 states and 23977 transitions. Word has length 54 [2025-04-13 23:29:12,821 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:12,821 INFO L485 AbstractCegarLoop]: Abstraction has 6548 states and 23977 transitions. [2025-04-13 23:29:12,821 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:12,822 INFO L278 IsEmpty]: Start isEmpty. Operand 6548 states and 23977 transitions. [2025-04-13 23:29:12,832 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:12,833 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:12,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:12,833 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable218 [2025-04-13 23:29:12,833 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 23:29:12,833 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:12,833 INFO L85 PathProgramCache]: Analyzing trace with hash -482939823, now seen corresponding path program 220 times [2025-04-13 23:29:12,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:12,833 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789079263] [2025-04-13 23:29:12,833 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:29:12,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:12,836 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:29:12,848 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 23:29:12,848 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:29:12,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:13,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:13,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:13,480 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789079263] [2025-04-13 23:29:13,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789079263] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:13,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:13,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 23:29:13,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427985438] [2025-04-13 23:29:13,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:13,480 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:29:13,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:13,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:29:13,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:29:13,481 INFO L87 Difference]: Start difference. First operand 6548 states and 23977 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:14,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:14,547 INFO L93 Difference]: Finished difference Result 13403 states and 46863 transitions. [2025-04-13 23:29:14,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:29:14,547 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:14,547 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:14,601 INFO L225 Difference]: With dead ends: 13403 [2025-04-13 23:29:14,601 INFO L226 Difference]: Without dead ends: 13317 [2025-04-13 23:29:14,606 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=266, Invalid=604, Unknown=0, NotChecked=0, Total=870 [2025-04-13 23:29:14,606 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 428 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1847 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:14,606 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 147 Invalid, 1874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1847 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:29:14,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13317 states. [2025-04-13 23:29:14,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13317 to 6532. [2025-04-13 23:29:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6532 states, 6531 states have (on average 3.6648292757617518) internal successors, (23935), 6531 states have internal predecessors, (23935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:14,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 23935 transitions. [2025-04-13 23:29:14,781 INFO L79 Accepts]: Start accepts. Automaton has 6532 states and 23935 transitions. Word has length 54 [2025-04-13 23:29:14,781 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:14,782 INFO L485 AbstractCegarLoop]: Abstraction has 6532 states and 23935 transitions. [2025-04-13 23:29:14,782 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:14,782 INFO L278 IsEmpty]: Start isEmpty. Operand 6532 states and 23935 transitions. [2025-04-13 23:29:14,792 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:14,792 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:14,793 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:14,793 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable219 [2025-04-13 23:29:14,793 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 23:29:14,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:14,793 INFO L85 PathProgramCache]: Analyzing trace with hash 116575757, now seen corresponding path program 221 times [2025-04-13 23:29:14,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:14,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61721879] [2025-04-13 23:29:14,793 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:29:14,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:14,796 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:14,806 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:14,806 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:29:14,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:15,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:15,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:15,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61721879] [2025-04-13 23:29:15,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61721879] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:15,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:15,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:15,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094709691] [2025-04-13 23:29:15,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:15,397 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:15,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:15,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:15,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:15,398 INFO L87 Difference]: Start difference. First operand 6532 states and 23935 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:16,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:16,389 INFO L93 Difference]: Finished difference Result 12730 states and 45192 transitions. [2025-04-13 23:29:16,389 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:16,390 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:16,390 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:16,436 INFO L225 Difference]: With dead ends: 12730 [2025-04-13 23:29:16,436 INFO L226 Difference]: Without dead ends: 12659 [2025-04-13 23:29:16,440 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:29:16,440 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 294 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:16,440 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 109 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:29:16,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12659 states. [2025-04-13 23:29:16,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12659 to 6557. [2025-04-13 23:29:16,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6557 states, 6556 states have (on average 3.6638194020744357) internal successors, (24020), 6556 states have internal predecessors, (24020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:16,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6557 states to 6557 states and 24020 transitions. [2025-04-13 23:29:16,600 INFO L79 Accepts]: Start accepts. Automaton has 6557 states and 24020 transitions. Word has length 54 [2025-04-13 23:29:16,600 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:16,600 INFO L485 AbstractCegarLoop]: Abstraction has 6557 states and 24020 transitions. [2025-04-13 23:29:16,600 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:16,600 INFO L278 IsEmpty]: Start isEmpty. Operand 6557 states and 24020 transitions. [2025-04-13 23:29:16,611 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:16,611 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:16,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 23:29:16,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220 [2025-04-13 23:29:16,611 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 23:29:16,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:16,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1226249087, now seen corresponding path program 222 times [2025-04-13 23:29:16,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:16,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971980255] [2025-04-13 23:29:16,612 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:29:16,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:16,615 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:16,625 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:16,625 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:29:16,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:17,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:17,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971980255] [2025-04-13 23:29:17,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971980255] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:17,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:17,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:17,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836362485] [2025-04-13 23:29:17,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:17,193 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:17,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:17,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:17,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:17,193 INFO L87 Difference]: Start difference. First operand 6557 states and 24020 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:18,205 INFO L93 Difference]: Finished difference Result 11515 states and 40900 transitions. [2025-04-13 23:29:18,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:18,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 23:29:18,205 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:18,257 INFO L225 Difference]: With dead ends: 11515 [2025-04-13 23:29:18,257 INFO L226 Difference]: Without dead ends: 11447 [2025-04-13 23:29:18,261 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:29:18,261 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 300 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:18,261 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 130 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:29:18,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11447 states. [2025-04-13 23:29:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11447 to 6587. [2025-04-13 23:29:18,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6587 states, 6586 states have (on average 3.6615548132402065) internal successors, (24115), 6586 states have internal predecessors, (24115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:18,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6587 states to 6587 states and 24115 transitions. [2025-04-13 23:29:18,486 INFO L79 Accepts]: Start accepts. Automaton has 6587 states and 24115 transitions. Word has length 54 [2025-04-13 23:29:18,486 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:18,486 INFO L485 AbstractCegarLoop]: Abstraction has 6587 states and 24115 transitions. [2025-04-13 23:29:18,486 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:18,486 INFO L278 IsEmpty]: Start isEmpty. Operand 6587 states and 24115 transitions. [2025-04-13 23:29:18,497 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:18,497 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:18,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:18,497 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable221 [2025-04-13 23:29:18,497 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 23:29:18,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:18,498 INFO L85 PathProgramCache]: Analyzing trace with hash 916580333, now seen corresponding path program 223 times [2025-04-13 23:29:18,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:18,498 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274269791] [2025-04-13 23:29:18,498 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:29:18,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:18,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:18,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:18,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:29:18,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:19,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:19,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:19,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274269791] [2025-04-13 23:29:19,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274269791] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:19,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:19,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:19,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297584799] [2025-04-13 23:29:19,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:19,123 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:19,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:19,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:19,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:19,123 INFO L87 Difference]: Start difference. First operand 6587 states and 24115 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:20,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:20,028 INFO L93 Difference]: Finished difference Result 12757 states and 45270 transitions. [2025-04-13 23:29:20,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29: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 23:29:20,029 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:20,087 INFO L225 Difference]: With dead ends: 12757 [2025-04-13 23:29:20,087 INFO L226 Difference]: Without dead ends: 12679 [2025-04-13 23:29:20,092 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:29:20,092 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 311 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:20,092 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 96 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1472 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:29:20,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12679 states. [2025-04-13 23:29:20,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12679 to 6577. [2025-04-13 23:29:20,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6577 states, 6576 states have (on average 3.662560827250608) internal successors, (24085), 6576 states have internal predecessors, (24085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6577 states to 6577 states and 24085 transitions. [2025-04-13 23:29:20,270 INFO L79 Accepts]: Start accepts. Automaton has 6577 states and 24085 transitions. Word has length 54 [2025-04-13 23:29:20,270 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:20,270 INFO L485 AbstractCegarLoop]: Abstraction has 6577 states and 24085 transitions. [2025-04-13 23:29:20,270 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:20,270 INFO L278 IsEmpty]: Start isEmpty. Operand 6577 states and 24085 transitions. [2025-04-13 23:29:20,282 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:20,282 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:20,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:20,282 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable222 [2025-04-13 23:29:20,282 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 23:29:20,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:20,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1996727069, now seen corresponding path program 224 times [2025-04-13 23:29:20,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:20,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501477211] [2025-04-13 23:29:20,282 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:29:20,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:20,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:20,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:20,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:29:20,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:20,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:20,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501477211] [2025-04-13 23:29:20,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501477211] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:20,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:20,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:20,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141048333] [2025-04-13 23:29:20,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:20,907 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:20,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:20,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:20,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:20,907 INFO L87 Difference]: Start difference. First operand 6577 states and 24085 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:21,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:21,871 INFO L93 Difference]: Finished difference Result 11507 states and 40865 transitions. [2025-04-13 23:29:21,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:21,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 23:29:21,871 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:21,920 INFO L225 Difference]: With dead ends: 11507 [2025-04-13 23:29:21,920 INFO L226 Difference]: Without dead ends: 11427 [2025-04-13 23:29:21,925 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:29:21,925 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 289 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:21,925 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 134 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1671 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:29:21,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11427 states. [2025-04-13 23:29:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11427 to 6567. [2025-04-13 23:29:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6567 states, 6566 states have (on average 3.6628084069448676) internal successors, (24050), 6566 states have internal predecessors, (24050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6567 states to 6567 states and 24050 transitions. [2025-04-13 23:29:22,095 INFO L79 Accepts]: Start accepts. Automaton has 6567 states and 24050 transitions. Word has length 54 [2025-04-13 23:29:22,095 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:22,095 INFO L485 AbstractCegarLoop]: Abstraction has 6567 states and 24050 transitions. [2025-04-13 23:29:22,095 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:22,095 INFO L278 IsEmpty]: Start isEmpty. Operand 6567 states and 24050 transitions. [2025-04-13 23:29:22,106 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:22,106 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:22,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 23:29:22,106 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable223 [2025-04-13 23:29:22,106 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 23:29:22,107 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:22,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2001562091, now seen corresponding path program 225 times [2025-04-13 23:29:22,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:22,107 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730338616] [2025-04-13 23:29:22,107 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:29:22,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:22,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:22,120 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:22,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:29:22,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:22,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:22,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:22,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730338616] [2025-04-13 23:29:22,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730338616] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:22,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:22,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:22,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212738418] [2025-04-13 23:29:22,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:22,749 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:22,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:22,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:22,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:22,750 INFO L87 Difference]: Start difference. First operand 6567 states and 24050 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:23,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:23,701 INFO L93 Difference]: Finished difference Result 12821 states and 45428 transitions. [2025-04-13 23:29:23,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:23,701 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:23,701 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:23,756 INFO L225 Difference]: With dead ends: 12821 [2025-04-13 23:29:23,756 INFO L226 Difference]: Without dead ends: 12750 [2025-04-13 23:29:23,761 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:29:23,762 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 292 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1526 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:23,762 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 103 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:29:23,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12750 states. [2025-04-13 23:29:23,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12750 to 6578. [2025-04-13 23:29:23,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6578 states, 6577 states have (on average 3.6607875931275657) internal successors, (24077), 6577 states have internal predecessors, (24077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6578 states to 6578 states and 24077 transitions. [2025-04-13 23:29:23,939 INFO L79 Accepts]: Start accepts. Automaton has 6578 states and 24077 transitions. Word has length 54 [2025-04-13 23:29:23,939 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:23,939 INFO L485 AbstractCegarLoop]: Abstraction has 6578 states and 24077 transitions. [2025-04-13 23:29:23,939 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:23,939 INFO L278 IsEmpty]: Start isEmpty. Operand 6578 states and 24077 transitions. [2025-04-13 23:29:23,950 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:23,950 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:23,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 23:29:23,950 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable224 [2025-04-13 23:29:23,950 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 23:29:23,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:23,951 INFO L85 PathProgramCache]: Analyzing trace with hash -388411887, now seen corresponding path program 226 times [2025-04-13 23:29:23,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:23,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049099477] [2025-04-13 23:29:23,951 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:29:23,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:23,953 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:29:23,966 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 23:29:23,966 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:29:23,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:24,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:24,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:24,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049099477] [2025-04-13 23:29:24,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049099477] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:24,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:24,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:24,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690321619] [2025-04-13 23:29:24,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:24,569 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:24,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:24,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:24,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:24,570 INFO L87 Difference]: Start difference. First operand 6578 states and 24077 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:25,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:25,601 INFO L93 Difference]: Finished difference Result 11482 states and 40809 transitions. [2025-04-13 23:29:25,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:25,601 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:25,601 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:25,648 INFO L225 Difference]: With dead ends: 11482 [2025-04-13 23:29:25,648 INFO L226 Difference]: Without dead ends: 11348 [2025-04-13 23:29:25,653 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:29:25,653 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 255 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:25,653 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 136 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1699 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:29:25,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11348 states. [2025-04-13 23:29:25,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11348 to 6558. [2025-04-13 23:29:25,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6558 states, 6557 states have (on average 3.6612780234863505) internal successors, (24007), 6557 states have internal predecessors, (24007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6558 states to 6558 states and 24007 transitions. [2025-04-13 23:29:25,813 INFO L79 Accepts]: Start accepts. Automaton has 6558 states and 24007 transitions. Word has length 54 [2025-04-13 23:29:25,814 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:25,814 INFO L485 AbstractCegarLoop]: Abstraction has 6558 states and 24007 transitions. [2025-04-13 23:29:25,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 23:29:25,814 INFO L278 IsEmpty]: Start isEmpty. Operand 6558 states and 24007 transitions. [2025-04-13 23:29:25,824 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:25,824 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:25,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:25,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable225 [2025-04-13 23:29:25,825 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 23:29:25,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:25,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1061426765, now seen corresponding path program 227 times [2025-04-13 23:29:25,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:25,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609671985] [2025-04-13 23:29:25,825 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:29:25,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:25,828 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:25,838 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:25,838 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:29:25,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:26,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:26,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:26,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609671985] [2025-04-13 23:29:26,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609671985] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:26,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:26,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:26,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309186579] [2025-04-13 23:29:26,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:26,451 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:26,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:26,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:26,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:26,451 INFO L87 Difference]: Start difference. First operand 6558 states and 24007 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:27,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:27,394 INFO L93 Difference]: Finished difference Result 12752 states and 45232 transitions. [2025-04-13 23:29:27,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:27,394 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:27,394 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:27,450 INFO L225 Difference]: With dead ends: 12752 [2025-04-13 23:29:27,450 INFO L226 Difference]: Without dead ends: 12671 [2025-04-13 23:29:27,455 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:29:27,455 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 269 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:27,455 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 108 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:29:27,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12671 states. [2025-04-13 23:29:27,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12671 to 6547. [2025-04-13 23:29:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6547 states, 6546 states have (on average 3.662542010388023) internal successors, (23975), 6546 states have internal predecessors, (23975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6547 states to 6547 states and 23975 transitions. [2025-04-13 23:29:27,627 INFO L79 Accepts]: Start accepts. Automaton has 6547 states and 23975 transitions. Word has length 54 [2025-04-13 23:29:27,627 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:27,627 INFO L485 AbstractCegarLoop]: Abstraction has 6547 states and 23975 transitions. [2025-04-13 23:29: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 23:29:27,627 INFO L278 IsEmpty]: Start isEmpty. Operand 6547 states and 23975 transitions. [2025-04-13 23:29:27,661 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:27,661 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:27,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 23:29:27,661 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226 [2025-04-13 23:29:27,661 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 23:29:27,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:27,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1224641407, now seen corresponding path program 228 times [2025-04-13 23:29:27,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:27,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948044778] [2025-04-13 23:29:27,662 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:29:27,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:27,665 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:27,675 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:27,675 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:29:27,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:28,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:28,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948044778] [2025-04-13 23:29:28,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948044778] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:28,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:28,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:28,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838638344] [2025-04-13 23:29:28,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:28,265 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:28,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:28,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:28,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:28,266 INFO L87 Difference]: Start difference. First operand 6547 states and 23975 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:29,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:29,334 INFO L93 Difference]: Finished difference Result 11555 states and 41001 transitions. [2025-04-13 23:29:29,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:29,334 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:29,334 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:29,382 INFO L225 Difference]: With dead ends: 11555 [2025-04-13 23:29:29,382 INFO L226 Difference]: Without dead ends: 11484 [2025-04-13 23:29:29,387 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:29:29,387 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 287 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:29,387 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 129 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1619 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:29:29,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11484 states. [2025-04-13 23:29:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11484 to 6580. [2025-04-13 23:29:29,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6580 states, 6579 states have (on average 3.6598267213862288) internal successors, (24078), 6579 states have internal predecessors, (24078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:29,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6580 states to 6580 states and 24078 transitions. [2025-04-13 23:29:29,547 INFO L79 Accepts]: Start accepts. Automaton has 6580 states and 24078 transitions. Word has length 54 [2025-04-13 23:29:29,548 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:29,548 INFO L485 AbstractCegarLoop]: Abstraction has 6580 states and 24078 transitions. [2025-04-13 23:29:29,548 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:29,548 INFO L278 IsEmpty]: Start isEmpty. Operand 6580 states and 24078 transitions. [2025-04-13 23:29:29,558 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:29,558 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:29,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:29,559 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable227 [2025-04-13 23:29:29,559 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 23:29:29,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:29,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1837156299, now seen corresponding path program 229 times [2025-04-13 23:29:29,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:29,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314812590] [2025-04-13 23:29:29,559 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:29:29,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:29,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:29,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:29,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:29:29,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:30,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:30,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314812590] [2025-04-13 23:29:30,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314812590] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:30,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:30,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:30,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118481159] [2025-04-13 23:29:30,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:30,212 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:30,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:30,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:30,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:30,213 INFO L87 Difference]: Start difference. First operand 6580 states and 24078 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:31,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:31,061 INFO L93 Difference]: Finished difference Result 12830 states and 45446 transitions. [2025-04-13 23:29:31,061 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:31,061 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:31,061 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:31,114 INFO L225 Difference]: With dead ends: 12830 [2025-04-13 23:29:31,115 INFO L226 Difference]: Without dead ends: 12762 [2025-04-13 23:29:31,120 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 23:29:31,120 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 322 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:31,120 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 89 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:29:31,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12762 states. [2025-04-13 23:29:31,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12762 to 6590. [2025-04-13 23:29:31,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6590 states, 6589 states have (on average 3.658066474427075) internal successors, (24103), 6589 states have internal predecessors, (24103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6590 states to 6590 states and 24103 transitions. [2025-04-13 23:29:31,290 INFO L79 Accepts]: Start accepts. Automaton has 6590 states and 24103 transitions. Word has length 54 [2025-04-13 23:29:31,290 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:31,290 INFO L485 AbstractCegarLoop]: Abstraction has 6590 states and 24103 transitions. [2025-04-13 23:29:31,290 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:31,290 INFO L278 IsEmpty]: Start isEmpty. Operand 6590 states and 24103 transitions. [2025-04-13 23:29:31,301 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:31,301 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:31,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:31,301 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable228 [2025-04-13 23:29:31,301 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 23:29:31,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:31,302 INFO L85 PathProgramCache]: Analyzing trace with hash 2130190563, now seen corresponding path program 230 times [2025-04-13 23:29:31,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:31,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474323274] [2025-04-13 23:29:31,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:29:31,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:31,304 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:31,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:31,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:29:31,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:31,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:31,944 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474323274] [2025-04-13 23:29:31,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474323274] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:31,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:31,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:31,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664651732] [2025-04-13 23:29:31,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:31,944 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:31,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:31,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:31,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:31,945 INFO L87 Difference]: Start difference. First operand 6590 states and 24103 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:32,801 INFO L93 Difference]: Finished difference Result 11564 states and 41013 transitions. [2025-04-13 23:29:32,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:32,801 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:32,801 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:32,851 INFO L225 Difference]: With dead ends: 11564 [2025-04-13 23:29:32,852 INFO L226 Difference]: Without dead ends: 11483 [2025-04-13 23:29:32,855 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:29:32,856 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 290 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:32,856 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 101 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:29:32,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11483 states. [2025-04-13 23:29:32,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11483 to 6579. [2025-04-13 23:29:32,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6579 states, 6578 states have (on average 3.6584068105807237) internal successors, (24065), 6578 states have internal predecessors, (24065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:32,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6579 states to 6579 states and 24065 transitions. [2025-04-13 23:29:33,025 INFO L79 Accepts]: Start accepts. Automaton has 6579 states and 24065 transitions. Word has length 54 [2025-04-13 23:29:33,025 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:33,025 INFO L485 AbstractCegarLoop]: Abstraction has 6579 states and 24065 transitions. [2025-04-13 23:29:33,025 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:33,026 INFO L278 IsEmpty]: Start isEmpty. Operand 6579 states and 24065 transitions. [2025-04-13 23:29:33,036 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:33,036 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:33,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:33,036 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable229 [2025-04-13 23:29:33,036 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 23:29:33,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:33,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1066678317, now seen corresponding path program 231 times [2025-04-13 23:29:33,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:33,037 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776753120] [2025-04-13 23:29:33,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:29:33,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:33,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:33,050 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:33,050 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:29:33,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:33,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:33,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:33,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776753120] [2025-04-13 23:29:33,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776753120] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:33,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:33,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:33,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144998784] [2025-04-13 23:29:33,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:33,679 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:33,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:33,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:33,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:33,679 INFO L87 Difference]: Start difference. First operand 6579 states and 24065 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:34,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:34,546 INFO L93 Difference]: Finished difference Result 12773 states and 45290 transitions. [2025-04-13 23:29:34,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:34,546 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:34,547 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:34,602 INFO L225 Difference]: With dead ends: 12773 [2025-04-13 23:29:34,602 INFO L226 Difference]: Without dead ends: 12688 [2025-04-13 23:29:34,607 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 23:29:34,607 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 337 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:34,607 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 83 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:29:34,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12688 states. [2025-04-13 23:29:34,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12688 to 6564. [2025-04-13 23:29:34,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6564 states, 6563 states have (on average 3.6606734724973333) internal successors, (24025), 6563 states have internal predecessors, (24025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:34,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6564 states to 6564 states and 24025 transitions. [2025-04-13 23:29:34,800 INFO L79 Accepts]: Start accepts. Automaton has 6564 states and 24025 transitions. Word has length 54 [2025-04-13 23:29:34,800 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:34,800 INFO L485 AbstractCegarLoop]: Abstraction has 6564 states and 24025 transitions. [2025-04-13 23:29:34,800 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:34,801 INFO L278 IsEmpty]: Start isEmpty. Operand 6564 states and 24025 transitions. [2025-04-13 23:29:34,811 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:34,811 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:34,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:34,811 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230 [2025-04-13 23:29:34,811 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 23:29:34,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:34,812 INFO L85 PathProgramCache]: Analyzing trace with hash -551209999, now seen corresponding path program 232 times [2025-04-13 23:29:34,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:34,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218253797] [2025-04-13 23:29:34,812 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:29:34,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:34,815 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:29:34,826 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 23:29:34,827 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:29:34,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:35,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:35,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:35,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218253797] [2025-04-13 23:29:35,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218253797] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:35,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:35,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:35,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621147894] [2025-04-13 23:29:35,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:35,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:35,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:35,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:35,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:35,398 INFO L87 Difference]: Start difference. First operand 6564 states and 24025 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:36,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:36,343 INFO L93 Difference]: Finished difference Result 11468 states and 40757 transitions. [2025-04-13 23:29:36,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:36,344 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:36,344 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:36,393 INFO L225 Difference]: With dead ends: 11468 [2025-04-13 23:29:36,393 INFO L226 Difference]: Without dead ends: 11322 [2025-04-13 23:29:36,397 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:29:36,397 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 270 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:36,397 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 117 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:29:36,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11322 states. [2025-04-13 23:29:36,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11322 to 6532. [2025-04-13 23:29:36,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6532 states, 6531 states have (on average 3.6632981166743224) internal successors, (23925), 6531 states have internal predecessors, (23925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 23925 transitions. [2025-04-13 23:29:36,560 INFO L79 Accepts]: Start accepts. Automaton has 6532 states and 23925 transitions. Word has length 54 [2025-04-13 23:29:36,560 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:36,560 INFO L485 AbstractCegarLoop]: Abstraction has 6532 states and 23925 transitions. [2025-04-13 23:29:36,560 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:36,560 INFO L278 IsEmpty]: Start isEmpty. Operand 6532 states and 23925 transitions. [2025-04-13 23:29:36,571 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:36,571 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:36,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:36,571 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231 [2025-04-13 23:29:36,571 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 23:29:36,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:36,571 INFO L85 PathProgramCache]: Analyzing trace with hash 319725181, now seen corresponding path program 233 times [2025-04-13 23:29:36,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:36,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339073712] [2025-04-13 23:29:36,571 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:29:36,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:36,574 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:36,585 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:36,585 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:29:36,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:37,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 23:29:37,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:37,204 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339073712] [2025-04-13 23:29:37,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339073712] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:37,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:37,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:37,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708960119] [2025-04-13 23:29:37,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:37,204 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:37,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:37,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:37,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:37,205 INFO L87 Difference]: Start difference. First operand 6532 states and 23925 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:38,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:38,095 INFO L93 Difference]: Finished difference Result 12604 states and 44812 transitions. [2025-04-13 23:29:38,095 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:38,095 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:38,095 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:38,148 INFO L225 Difference]: With dead ends: 12604 [2025-04-13 23:29:38,149 INFO L226 Difference]: Without dead ends: 12533 [2025-04-13 23:29:38,153 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:29:38,154 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 277 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:38,154 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 111 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:29:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12533 states. [2025-04-13 23:29:38,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12533 to 6565. [2025-04-13 23:29:38,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6565 states, 6564 states have (on average 3.660572821450335) internal successors, (24028), 6564 states have internal predecessors, (24028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6565 states to 6565 states and 24028 transitions. [2025-04-13 23:29:38,321 INFO L79 Accepts]: Start accepts. Automaton has 6565 states and 24028 transitions. Word has length 54 [2025-04-13 23:29:38,321 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:38,321 INFO L485 AbstractCegarLoop]: Abstraction has 6565 states and 24028 transitions. [2025-04-13 23:29:38,321 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:38,321 INFO L278 IsEmpty]: Start isEmpty. Operand 6565 states and 24028 transitions. [2025-04-13 23:29:38,332 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:38,332 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:38,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:38,332 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable232 [2025-04-13 23:29:38,332 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 23:29:38,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:38,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1303286929, now seen corresponding path program 234 times [2025-04-13 23:29:38,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:38,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14283695] [2025-04-13 23:29:38,333 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:29:38,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:38,335 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:38,346 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:38,346 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:29:38,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:38,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 23:29:38,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:38,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14283695] [2025-04-13 23:29:38,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14283695] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:38,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:38,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:38,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212128657] [2025-04-13 23:29:38,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:38,971 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:38,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:38,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:38,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:38,972 INFO L87 Difference]: Start difference. First operand 6565 states and 24028 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:40,020 INFO L93 Difference]: Finished difference Result 11496 states and 40810 transitions. [2025-04-13 23:29:40,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:40,020 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:40,020 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:40,070 INFO L225 Difference]: With dead ends: 11496 [2025-04-13 23:29:40,071 INFO L226 Difference]: Without dead ends: 11379 [2025-04-13 23:29:40,075 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:29:40,075 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 263 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1777 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:40,075 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 143 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1777 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:29:40,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11379 states. [2025-04-13 23:29:40,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11379 to 6664. [2025-04-13 23:29:40,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6664 states, 6663 states have (on average 3.65090799939967) internal successors, (24326), 6663 states have internal predecessors, (24326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6664 states to 6664 states and 24326 transitions. [2025-04-13 23:29:40,244 INFO L79 Accepts]: Start accepts. Automaton has 6664 states and 24326 transitions. Word has length 54 [2025-04-13 23:29:40,245 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:40,245 INFO L485 AbstractCegarLoop]: Abstraction has 6664 states and 24326 transitions. [2025-04-13 23:29:40,245 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:40,245 INFO L278 IsEmpty]: Start isEmpty. Operand 6664 states and 24326 transitions. [2025-04-13 23:29:40,256 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:40,256 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:40,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 23:29:40,256 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable233 [2025-04-13 23:29:40,256 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 23:29:40,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:40,256 INFO L85 PathProgramCache]: Analyzing trace with hash -620410145, now seen corresponding path program 235 times [2025-04-13 23:29:40,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:40,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733132414] [2025-04-13 23:29:40,256 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:29:40,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:40,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:40,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:40,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:29:40,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:40,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:40,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:40,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733132414] [2025-04-13 23:29:40,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733132414] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:40,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:40,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:40,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662748430] [2025-04-13 23:29:40,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:40,856 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:40,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:40,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:40,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:40,856 INFO L87 Difference]: Start difference. First operand 6664 states and 24326 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:41,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:41,713 INFO L93 Difference]: Finished difference Result 12702 states and 45097 transitions. [2025-04-13 23:29:41,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:41,714 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:41,714 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:41,765 INFO L225 Difference]: With dead ends: 12702 [2025-04-13 23:29:41,766 INFO L226 Difference]: Without dead ends: 12621 [2025-04-13 23:29:41,771 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 23:29:41,772 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 273 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:41,772 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 78 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:29:41,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12621 states. [2025-04-13 23:29:41,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12621 to 6653. [2025-04-13 23:29:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6653 states, 6652 states have (on average 3.6512327119663257) internal successors, (24288), 6652 states have internal predecessors, (24288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:41,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6653 states to 6653 states and 24288 transitions. [2025-04-13 23:29:41,943 INFO L79 Accepts]: Start accepts. Automaton has 6653 states and 24288 transitions. Word has length 54 [2025-04-13 23:29:41,943 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:41,943 INFO L485 AbstractCegarLoop]: Abstraction has 6653 states and 24288 transitions. [2025-04-13 23:29:41,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 23:29:41,943 INFO L278 IsEmpty]: Start isEmpty. Operand 6653 states and 24288 transitions. [2025-04-13 23:29:41,954 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:41,954 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:41,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:41,954 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable234 [2025-04-13 23:29:41,954 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 23:29:41,954 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:41,954 INFO L85 PathProgramCache]: Analyzing trace with hash -131780561, now seen corresponding path program 236 times [2025-04-13 23:29:41,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:41,955 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262217382] [2025-04-13 23:29:41,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:29:41,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:41,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:41,968 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:41,968 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:29:41,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:42,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 23:29:42,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:42,561 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262217382] [2025-04-13 23:29:42,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262217382] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:42,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:42,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:42,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088218496] [2025-04-13 23:29:42,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:42,561 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:42,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:42,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:42,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:42,562 INFO L87 Difference]: Start difference. First operand 6653 states and 24288 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:43,488 INFO L93 Difference]: Finished difference Result 11520 states and 40832 transitions. [2025-04-13 23:29:43,488 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:43,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 23:29:43,488 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:43,542 INFO L225 Difference]: With dead ends: 11520 [2025-04-13 23:29:43,542 INFO L226 Difference]: Without dead ends: 11449 [2025-04-13 23:29:43,546 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:29:43,547 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 303 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:43,547 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 106 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:29:43,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11449 states. [2025-04-13 23:29:43,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11449 to 6664. [2025-04-13 23:29:43,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6664 states, 6663 states have (on average 3.64925709140027) internal successors, (24315), 6663 states have internal predecessors, (24315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:43,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6664 states to 6664 states and 24315 transitions. [2025-04-13 23:29:43,788 INFO L79 Accepts]: Start accepts. Automaton has 6664 states and 24315 transitions. Word has length 54 [2025-04-13 23:29:43,788 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:43,788 INFO L485 AbstractCegarLoop]: Abstraction has 6664 states and 24315 transitions. [2025-04-13 23:29:43,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 23:29:43,788 INFO L278 IsEmpty]: Start isEmpty. Operand 6664 states and 24315 transitions. [2025-04-13 23:29:43,799 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:43,799 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:43,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 23:29:43,799 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable235 [2025-04-13 23:29:43,800 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 23:29:43,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:43,800 INFO L85 PathProgramCache]: Analyzing trace with hash 993156589, now seen corresponding path program 237 times [2025-04-13 23:29:43,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:43,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193635932] [2025-04-13 23:29:43,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:29:43,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:43,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:43,813 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:43,813 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:29:43,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:44,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:44,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:44,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193635932] [2025-04-13 23:29:44,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193635932] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:44,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:44,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:44,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247091878] [2025-04-13 23:29:44,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:44,431 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:44,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:44,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:44,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:44,432 INFO L87 Difference]: Start difference. First operand 6664 states and 24315 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:45,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:45,232 INFO L93 Difference]: Finished difference Result 12676 states and 45038 transitions. [2025-04-13 23:29:45,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:45,232 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:45,232 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:45,292 INFO L225 Difference]: With dead ends: 12676 [2025-04-13 23:29:45,292 INFO L226 Difference]: Without dead ends: 12540 [2025-04-13 23:29:45,297 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:29:45,297 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 260 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:45,297 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 88 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:29:45,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12540 states. [2025-04-13 23:29:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12540 to 6642. [2025-04-13 23:29:45,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6642 states, 6641 states have (on average 3.650052702906189) internal successors, (24240), 6641 states have internal predecessors, (24240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6642 states to 6642 states and 24240 transitions. [2025-04-13 23:29:45,471 INFO L79 Accepts]: Start accepts. Automaton has 6642 states and 24240 transitions. Word has length 54 [2025-04-13 23:29:45,471 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:45,471 INFO L485 AbstractCegarLoop]: Abstraction has 6642 states and 24240 transitions. [2025-04-13 23:29:45,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 23:29:45,471 INFO L278 IsEmpty]: Start isEmpty. Operand 6642 states and 24240 transitions. [2025-04-13 23:29:45,482 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:45,482 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:45,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:45,482 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236 [2025-04-13 23:29:45,482 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 23:29:45,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:45,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1071915887, now seen corresponding path program 238 times [2025-04-13 23:29:45,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:45,483 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838573216] [2025-04-13 23:29:45,483 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:29:45,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:45,485 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:29:45,498 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 23:29:45,498 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:29:45,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:46,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:46,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:46,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838573216] [2025-04-13 23:29:46,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838573216] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:46,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:46,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:46,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511956490] [2025-04-13 23:29:46,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:46,100 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:46,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:46,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:46,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:46,100 INFO L87 Difference]: Start difference. First operand 6642 states and 24240 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:47,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:47,095 INFO L93 Difference]: Finished difference Result 11427 states and 40566 transitions. [2025-04-13 23:29:47,095 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:47,095 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:47,096 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:47,149 INFO L225 Difference]: With dead ends: 11427 [2025-04-13 23:29:47,149 INFO L226 Difference]: Without dead ends: 11324 [2025-04-13 23:29:47,154 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:29:47,154 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 266 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:47,154 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 122 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:29:47,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11324 states. [2025-04-13 23:29:47,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11324 to 6609. [2025-04-13 23:29:47,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6609 states, 6608 states have (on average 3.6526937046004844) internal successors, (24137), 6608 states have internal predecessors, (24137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:47,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6609 states to 6609 states and 24137 transitions. [2025-04-13 23:29:47,326 INFO L79 Accepts]: Start accepts. Automaton has 6609 states and 24137 transitions. Word has length 54 [2025-04-13 23:29:47,327 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:47,327 INFO L485 AbstractCegarLoop]: Abstraction has 6609 states and 24137 transitions. [2025-04-13 23:29:47,327 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:47,327 INFO L278 IsEmpty]: Start isEmpty. Operand 6609 states and 24137 transitions. [2025-04-13 23:29:47,338 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:47,338 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:47,338 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:47,338 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable237 [2025-04-13 23:29:47,338 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 23:29:47,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:47,339 INFO L85 PathProgramCache]: Analyzing trace with hash 318117501, now seen corresponding path program 239 times [2025-04-13 23:29:47,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:47,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519240083] [2025-04-13 23:29:47,339 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:29:47,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:47,341 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:47,352 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:47,352 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:29:47,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:48,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 23:29:48,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:48,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519240083] [2025-04-13 23:29:48,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519240083] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:48,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:48,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:48,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203675275] [2025-04-13 23:29:48,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:48,005 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:48,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:48,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:48,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:48,005 INFO L87 Difference]: Start difference. First operand 6609 states and 24137 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:48,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:48,888 INFO L93 Difference]: Finished difference Result 12719 states and 45138 transitions. [2025-04-13 23:29:48,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:29:48,888 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:48,888 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:48,940 INFO L225 Difference]: With dead ends: 12719 [2025-04-13 23:29:48,940 INFO L226 Difference]: Without dead ends: 12651 [2025-04-13 23:29:48,945 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:29:48,945 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 293 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:48,945 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 95 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:29:48,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12651 states. [2025-04-13 23:29:49,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12651 to 6639. [2025-04-13 23:29:49,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6639 states, 6638 states have (on average 3.650497137692076) internal successors, (24232), 6638 states have internal predecessors, (24232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6639 states to 6639 states and 24232 transitions. [2025-04-13 23:29:49,118 INFO L79 Accepts]: Start accepts. Automaton has 6639 states and 24232 transitions. Word has length 54 [2025-04-13 23:29:49,118 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:49,118 INFO L485 AbstractCegarLoop]: Abstraction has 6639 states and 24232 transitions. [2025-04-13 23:29:49,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 23:29:49,118 INFO L278 IsEmpty]: Start isEmpty. Operand 6639 states and 24232 transitions. [2025-04-13 23:29:49,129 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:49,129 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:49,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:49,129 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable238 [2025-04-13 23:29:49,129 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 23:29:49,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:49,130 INFO L85 PathProgramCache]: Analyzing trace with hash -50381505, now seen corresponding path program 240 times [2025-04-13 23:29:49,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:49,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356208464] [2025-04-13 23:29:49,130 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:29:49,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:49,132 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:49,143 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:49,143 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:29:49,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:49,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 23:29:49,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:49,743 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356208464] [2025-04-13 23:29:49,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356208464] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:49,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:49,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:49,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404644881] [2025-04-13 23:29:49,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:49,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:49,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:49,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:49,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:49,744 INFO L87 Difference]: Start difference. First operand 6639 states and 24232 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:50,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:50,819 INFO L93 Difference]: Finished difference Result 11446 states and 40623 transitions. [2025-04-13 23:29:50,819 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:50,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 23:29:50,819 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:50,870 INFO L225 Difference]: With dead ends: 11446 [2025-04-13 23:29:50,870 INFO L226 Difference]: Without dead ends: 11375 [2025-04-13 23:29:50,874 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:29:50,875 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 260 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:50,875 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 130 Invalid, 1655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:29:50,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11375 states. [2025-04-13 23:29:50,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11375 to 6672. [2025-04-13 23:29:50,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6672 states, 6671 states have (on average 3.647878878728826) internal successors, (24335), 6671 states have internal predecessors, (24335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6672 states to 6672 states and 24335 transitions. [2025-04-13 23:29:51,042 INFO L79 Accepts]: Start accepts. Automaton has 6672 states and 24335 transitions. Word has length 54 [2025-04-13 23:29:51,042 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:51,042 INFO L485 AbstractCegarLoop]: Abstraction has 6672 states and 24335 transitions. [2025-04-13 23:29:51,042 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:51,042 INFO L278 IsEmpty]: Start isEmpty. Operand 6672 states and 24335 transitions. [2025-04-13 23:29:51,054 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:51,054 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:51,054 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:51,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable239 [2025-04-13 23:29:51,054 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 23:29:51,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:51,055 INFO L85 PathProgramCache]: Analyzing trace with hash -452360481, now seen corresponding path program 241 times [2025-04-13 23:29:51,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:51,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055990370] [2025-04-13 23:29:51,055 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:29:51,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:51,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:51,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:51,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:29:51,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:51,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:51,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055990370] [2025-04-13 23:29:51,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055990370] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:51,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:51,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:51,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559695498] [2025-04-13 23:29:51,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:51,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:51,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:51,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:51,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:51,709 INFO L87 Difference]: Start difference. First operand 6672 states and 24335 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:52,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:52,564 INFO L93 Difference]: Finished difference Result 12754 states and 45236 transitions. [2025-04-13 23:29:52,564 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:52,564 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:52,564 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:52,622 INFO L225 Difference]: With dead ends: 12754 [2025-04-13 23:29:52,622 INFO L226 Difference]: Without dead ends: 12674 [2025-04-13 23:29:52,627 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 23:29:52,627 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 305 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:52,627 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 84 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:29:52,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12674 states. [2025-04-13 23:29:52,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12674 to 6662. [2025-04-13 23:29:52,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6662 states, 6661 states have (on average 3.64810088575289) internal successors, (24300), 6661 states have internal predecessors, (24300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6662 states to 6662 states and 24300 transitions. [2025-04-13 23:29:52,878 INFO L79 Accepts]: Start accepts. Automaton has 6662 states and 24300 transitions. Word has length 54 [2025-04-13 23:29:52,878 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:52,878 INFO L485 AbstractCegarLoop]: Abstraction has 6662 states and 24300 transitions. [2025-04-13 23:29:52,879 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:52,879 INFO L278 IsEmpty]: Start isEmpty. Operand 6662 states and 24300 transitions. [2025-04-13 23:29:52,890 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:52,890 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:52,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:52,890 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240 [2025-04-13 23:29:52,890 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 23:29:52,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:52,891 INFO L85 PathProgramCache]: Analyzing trace with hash -990516831, now seen corresponding path program 242 times [2025-04-13 23:29:52,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:52,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139341210] [2025-04-13 23:29:52,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:29:52,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:52,894 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:52,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:52,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:29:52,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:53,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:53,492 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139341210] [2025-04-13 23:29:53,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139341210] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:53,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:53,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:53,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942040207] [2025-04-13 23:29:53,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:53,492 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:53,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:53,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:53,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:53,493 INFO L87 Difference]: Start difference. First operand 6662 states and 24300 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:54,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:54,443 INFO L93 Difference]: Finished difference Result 11435 states and 40575 transitions. [2025-04-13 23:29:54,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:54,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 23:29:54,443 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:54,497 INFO L225 Difference]: With dead ends: 11435 [2025-04-13 23:29:54,497 INFO L226 Difference]: Without dead ends: 11354 [2025-04-13 23:29:54,501 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:29:54,501 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 296 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:54,501 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 125 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1595 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:29:54,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11354 states. [2025-04-13 23:29:54,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11354 to 6651. [2025-04-13 23:29:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6651 states, 6650 states have (on average 3.648421052631579) internal successors, (24262), 6650 states have internal predecessors, (24262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:54,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6651 states to 6651 states and 24262 transitions. [2025-04-13 23:29:54,669 INFO L79 Accepts]: Start accepts. Automaton has 6651 states and 24262 transitions. Word has length 54 [2025-04-13 23:29:54,669 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:54,669 INFO L485 AbstractCegarLoop]: Abstraction has 6651 states and 24262 transitions. [2025-04-13 23:29:54,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:54,669 INFO L278 IsEmpty]: Start isEmpty. Operand 6651 states and 24262 transitions. [2025-04-13 23:29:54,680 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:54,680 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:54,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:54,681 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable241 [2025-04-13 23:29:54,681 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 23:29:54,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:54,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1155954701, now seen corresponding path program 243 times [2025-04-13 23:29:54,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:54,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910150815] [2025-04-13 23:29:54,681 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:29:54,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:54,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:54,694 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:54,694 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:29:54,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:55,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:55,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:55,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910150815] [2025-04-13 23:29:55,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910150815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:55,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:55,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:55,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079222288] [2025-04-13 23:29:55,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:55,321 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:55,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:55,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:55,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:55,322 INFO L87 Difference]: Start difference. First operand 6651 states and 24262 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:56,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:56,146 INFO L93 Difference]: Finished difference Result 12663 states and 44985 transitions. [2025-04-13 23:29:56,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:56,146 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:56,146 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:56,202 INFO L225 Difference]: With dead ends: 12663 [2025-04-13 23:29:56,202 INFO L226 Difference]: Without dead ends: 12519 [2025-04-13 23:29:56,207 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:29:56,207 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 269 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:56,207 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 93 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:29:56,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12519 states. [2025-04-13 23:29:56,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12519 to 6621. [2025-04-13 23:29:56,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6621 states, 6620 states have (on average 3.650604229607251) internal successors, (24167), 6620 states have internal predecessors, (24167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6621 states to 6621 states and 24167 transitions. [2025-04-13 23:29:56,411 INFO L79 Accepts]: Start accepts. Automaton has 6621 states and 24167 transitions. Word has length 54 [2025-04-13 23:29:56,411 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:56,411 INFO L485 AbstractCegarLoop]: Abstraction has 6621 states and 24167 transitions. [2025-04-13 23:29:56,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 23:29:56,411 INFO L278 IsEmpty]: Start isEmpty. Operand 6621 states and 24167 transitions. [2025-04-13 23:29:56,422 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:56,422 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:56,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:56,422 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable242 [2025-04-13 23:29:56,423 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 23:29:56,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:56,423 INFO L85 PathProgramCache]: Analyzing trace with hash 623049903, now seen corresponding path program 244 times [2025-04-13 23:29:56,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:56,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424047653] [2025-04-13 23:29:56,423 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:29:56,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:56,425 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:29:56,438 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 23:29:56,438 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:29:56,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:57,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:57,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424047653] [2025-04-13 23:29:57,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424047653] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:57,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:57,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:57,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269084821] [2025-04-13 23:29:57,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:57,052 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:57,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:57,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:57,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:57,053 INFO L87 Difference]: Start difference. First operand 6621 states and 24167 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:57,933 INFO L93 Difference]: Finished difference Result 11324 states and 40264 transitions. [2025-04-13 23:29:57,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:29:57,934 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:57,934 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:57,980 INFO L225 Difference]: With dead ends: 11324 [2025-04-13 23:29:57,980 INFO L226 Difference]: Without dead ends: 11046 [2025-04-13 23:29:57,984 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:29:57,985 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 288 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1363 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:57,985 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 103 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1363 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:29:57,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11046 states. [2025-04-13 23:29:58,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11046 to 6457. [2025-04-13 23:29:58,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6457 states, 6456 states have (on average 3.6655824039653035) internal successors, (23665), 6456 states have internal predecessors, (23665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:58,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6457 states to 6457 states and 23665 transitions. [2025-04-13 23:29:58,145 INFO L79 Accepts]: Start accepts. Automaton has 6457 states and 23665 transitions. Word has length 54 [2025-04-13 23:29:58,145 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:58,145 INFO L485 AbstractCegarLoop]: Abstraction has 6457 states and 23665 transitions. [2025-04-13 23:29:58,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 23:29:58,145 INFO L278 IsEmpty]: Start isEmpty. Operand 6457 states and 23665 transitions. [2025-04-13 23:29:58,156 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:58,156 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:58,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:58,156 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable243 [2025-04-13 23:29:58,156 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 23:29:58,156 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:58,156 INFO L85 PathProgramCache]: Analyzing trace with hash -746985363, now seen corresponding path program 245 times [2025-04-13 23:29:58,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:58,156 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185478120] [2025-04-13 23:29:58,156 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:29:58,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:58,159 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:58,170 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:58,170 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:29:58,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:29:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:29:58,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:29:58,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185478120] [2025-04-13 23:29:58,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185478120] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:29:58,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:29:58,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:29:58,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997316081] [2025-04-13 23:29:58,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:29:58,807 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:29:58,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:29:58,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:29:58,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:29:58,807 INFO L87 Difference]: Start difference. First operand 6457 states and 23665 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:59,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:29:59,680 INFO L93 Difference]: Finished difference Result 12359 states and 44053 transitions. [2025-04-13 23:29:59,680 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:29:59,680 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:29:59,680 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:29:59,729 INFO L225 Difference]: With dead ends: 12359 [2025-04-13 23:29:59,730 INFO L226 Difference]: Without dead ends: 12251 [2025-04-13 23:29:59,734 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:29:59,734 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 273 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:29:59,734 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 89 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:29:59,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12251 states. [2025-04-13 23:29:59,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12251 to 6517. [2025-04-13 23:29:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6517 states, 6516 states have (on average 3.660988336402701) internal successors, (23855), 6516 states have internal predecessors, (23855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:29:59,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6517 states to 6517 states and 23855 transitions. [2025-04-13 23:29:59,886 INFO L79 Accepts]: Start accepts. Automaton has 6517 states and 23855 transitions. Word has length 54 [2025-04-13 23:29:59,886 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:29:59,886 INFO L485 AbstractCegarLoop]: Abstraction has 6517 states and 23855 transitions. [2025-04-13 23:29:59,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 23:29:59,886 INFO L278 IsEmpty]: Start isEmpty. Operand 6517 states and 23855 transitions. [2025-04-13 23:29:59,896 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:29:59,896 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:29:59,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:29:59,896 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable244 [2025-04-13 23:29:59,897 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 23:29:59,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:29:59,897 INFO L85 PathProgramCache]: Analyzing trace with hash 715333091, now seen corresponding path program 246 times [2025-04-13 23:29:59,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:29:59,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493086320] [2025-04-13 23:29:59,897 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:29:59,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:29:59,900 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:29:59,911 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:29:59,911 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:29:59,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:00,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:00,517 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493086320] [2025-04-13 23:30:00,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493086320] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:00,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:00,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:00,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894240940] [2025-04-13 23:30:00,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:00,517 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:00,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:00,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:00,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:00,518 INFO L87 Difference]: Start difference. First operand 6517 states and 23855 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:01,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:01,572 INFO L93 Difference]: Finished difference Result 11490 states and 40842 transitions. [2025-04-13 23:30:01,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30: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 23:30:01,573 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:01,631 INFO L225 Difference]: With dead ends: 11490 [2025-04-13 23:30:01,632 INFO L226 Difference]: Without dead ends: 11422 [2025-04-13 23:30:01,636 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:30:01,636 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 309 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:01,636 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 116 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:30:01,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11422 states. [2025-04-13 23:30:01,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11422 to 6677. [2025-04-13 23:30:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6677 states, 6676 states have (on average 3.6593768723786697) internal successors, (24430), 6676 states have internal predecessors, (24430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:01,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6677 states to 6677 states and 24430 transitions. [2025-04-13 23:30:01,867 INFO L79 Accepts]: Start accepts. Automaton has 6677 states and 24430 transitions. Word has length 54 [2025-04-13 23:30:01,867 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:01,867 INFO L485 AbstractCegarLoop]: Abstraction has 6677 states and 24430 transitions. [2025-04-13 23:30:01,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 23:30:01,867 INFO L278 IsEmpty]: Start isEmpty. Operand 6677 states and 24430 transitions. [2025-04-13 23:30:01,878 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:01,878 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:01,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:01,878 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable245 [2025-04-13 23:30:01,878 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 23:30:01,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:01,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1217642485, now seen corresponding path program 247 times [2025-04-13 23:30:01,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:01,879 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003608200] [2025-04-13 23:30:01,879 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:30:01,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:01,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:01,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:01,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:30:01,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:02,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:02,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:02,517 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003608200] [2025-04-13 23:30:02,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003608200] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:02,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:02,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:02,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818767220] [2025-04-13 23:30:02,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:02,517 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:02,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:02,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:02,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:02,517 INFO L87 Difference]: Start difference. First operand 6677 states and 24430 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:03,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:03,420 INFO L93 Difference]: Finished difference Result 12559 states and 44701 transitions. [2025-04-13 23:30:03,421 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:03,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 23:30:03,421 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:03,476 INFO L225 Difference]: With dead ends: 12559 [2025-04-13 23:30:03,476 INFO L226 Difference]: Without dead ends: 12491 [2025-04-13 23:30:03,481 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:30:03,481 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 297 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 105 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 23:30:03,481 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 105 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:30:03,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12491 states. [2025-04-13 23:30:03,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12491 to 6687. [2025-04-13 23:30:03,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6687 states, 6686 states have (on average 3.6576428357762487) internal successors, (24455), 6686 states have internal predecessors, (24455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6687 states to 6687 states and 24455 transitions. [2025-04-13 23:30:03,657 INFO L79 Accepts]: Start accepts. Automaton has 6687 states and 24455 transitions. Word has length 54 [2025-04-13 23:30:03,657 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:03,657 INFO L485 AbstractCegarLoop]: Abstraction has 6687 states and 24455 transitions. [2025-04-13 23:30:03,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 23:30:03,658 INFO L278 IsEmpty]: Start isEmpty. Operand 6687 states and 24455 transitions. [2025-04-13 23:30:03,668 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:03,668 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:03,669 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:03,669 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable246 [2025-04-13 23:30:03,669 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 23:30:03,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:03,669 INFO L85 PathProgramCache]: Analyzing trace with hash -84671485, now seen corresponding path program 248 times [2025-04-13 23:30:03,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:03,669 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270300990] [2025-04-13 23:30:03,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:30:03,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:03,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:03,682 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:03,682 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:30:03,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:04,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:04,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:04,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270300990] [2025-04-13 23:30:04,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270300990] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:04,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:04,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:04,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123017257] [2025-04-13 23:30:04,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:04,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:04,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:04,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:04,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:04,303 INFO L87 Difference]: Start difference. First operand 6687 states and 24455 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:05,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:05,284 INFO L93 Difference]: Finished difference Result 11432 states and 40684 transitions. [2025-04-13 23:30:05,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:05,284 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:05,284 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:05,327 INFO L225 Difference]: With dead ends: 11432 [2025-04-13 23:30:05,327 INFO L226 Difference]: Without dead ends: 11351 [2025-04-13 23:30:05,330 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:30:05,330 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 278 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:05,330 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 111 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:30:05,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11351 states. [2025-04-13 23:30:05,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11351 to 6677. [2025-04-13 23:30:05,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6677 states, 6676 states have (on average 3.65787896944278) internal successors, (24420), 6676 states have internal predecessors, (24420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:05,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6677 states to 6677 states and 24420 transitions. [2025-04-13 23:30:05,473 INFO L79 Accepts]: Start accepts. Automaton has 6677 states and 24420 transitions. Word has length 54 [2025-04-13 23:30:05,473 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:05,473 INFO L485 AbstractCegarLoop]: Abstraction has 6677 states and 24420 transitions. [2025-04-13 23:30:05,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:05,473 INFO L278 IsEmpty]: Start isEmpty. Operand 6677 states and 24420 transitions. [2025-04-13 23:30:05,483 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:05,483 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:05,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 23:30:05,483 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable247 [2025-04-13 23:30:05,484 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 23:30:05,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:05,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1988120467, now seen corresponding path program 249 times [2025-04-13 23:30:05,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:05,484 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108156803] [2025-04-13 23:30:05,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:30:05,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:05,486 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:05,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:05,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:30:05,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:06,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 23:30:06,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:06,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108156803] [2025-04-13 23:30:06,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108156803] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:06,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:06,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:06,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426247601] [2025-04-13 23:30:06,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:06,131 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:06,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:06,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:06,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:06,131 INFO L87 Difference]: Start difference. First operand 6677 states and 24420 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:07,074 INFO L93 Difference]: Finished difference Result 12481 states and 44483 transitions. [2025-04-13 23:30:07,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:07,074 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:07,074 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:07,127 INFO L225 Difference]: With dead ends: 12481 [2025-04-13 23:30:07,127 INFO L226 Difference]: Without dead ends: 12381 [2025-04-13 23:30:07,132 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 23:30:07,132 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 239 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 1574 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:07,132 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 113 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1574 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:30:07,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12381 states. [2025-04-13 23:30:07,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12381 to 6647. [2025-04-13 23:30:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6647 states, 6646 states have (on average 3.6600962985254286) internal successors, (24325), 6646 states have internal predecessors, (24325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:07,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6647 states to 6647 states and 24325 transitions. [2025-04-13 23:30:07,308 INFO L79 Accepts]: Start accepts. Automaton has 6647 states and 24325 transitions. Word has length 54 [2025-04-13 23:30:07,308 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:07,308 INFO L485 AbstractCegarLoop]: Abstraction has 6647 states and 24325 transitions. [2025-04-13 23:30:07,308 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:07,308 INFO L278 IsEmpty]: Start isEmpty. Operand 6647 states and 24325 transitions. [2025-04-13 23:30:07,319 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:07,319 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:07,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 23:30:07,319 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable248 [2025-04-13 23:30:07,320 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 23:30:07,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:07,320 INFO L85 PathProgramCache]: Analyzing trace with hash 490373669, now seen corresponding path program 250 times [2025-04-13 23:30:07,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:07,320 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579231414] [2025-04-13 23:30:07,320 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:30:07,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:07,323 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:30:07,335 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 23:30:07,335 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:30:07,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:07,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:07,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:07,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579231414] [2025-04-13 23:30:07,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579231414] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:07,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:07,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 23:30:07,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022282846] [2025-04-13 23:30:07,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:07,990 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:30:07,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:07,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:30:07,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:30:07,990 INFO L87 Difference]: Start difference. First operand 6647 states and 24325 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:09,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:09,470 INFO L93 Difference]: Finished difference Result 12951 states and 45678 transitions. [2025-04-13 23:30:09,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 23:30:09,471 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:09,471 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:09,523 INFO L225 Difference]: With dead ends: 12951 [2025-04-13 23:30:09,523 INFO L226 Difference]: Without dead ends: 12823 [2025-04-13 23:30:09,528 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=294, Invalid=636, Unknown=0, NotChecked=0, Total=930 [2025-04-13 23:30:09,528 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 435 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:09,528 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 108 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:30:09,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12823 states. [2025-04-13 23:30:09,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12823 to 6627. [2025-04-13 23:30:09,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6627 states, 6626 states have (on average 3.6590703290069424) internal successors, (24245), 6626 states have internal predecessors, (24245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6627 states to 6627 states and 24245 transitions. [2025-04-13 23:30:09,700 INFO L79 Accepts]: Start accepts. Automaton has 6627 states and 24245 transitions. Word has length 54 [2025-04-13 23:30:09,701 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:09,701 INFO L485 AbstractCegarLoop]: Abstraction has 6627 states and 24245 transitions. [2025-04-13 23:30:09,701 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:09,701 INFO L278 IsEmpty]: Start isEmpty. Operand 6627 states and 24245 transitions. [2025-04-13 23:30:09,711 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:09,712 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:09,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:09,712 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable249 [2025-04-13 23:30:09,712 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 23:30:09,712 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:09,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1299041541, now seen corresponding path program 251 times [2025-04-13 23:30:09,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:09,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537080535] [2025-04-13 23:30:09,712 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:30:09,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:09,715 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:09,727 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:09,727 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:30:09,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:10,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:10,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537080535] [2025-04-13 23:30:10,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537080535] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:10,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:10,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:10,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181889788] [2025-04-13 23:30:10,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:10,355 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:10,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:10,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:10,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:10,356 INFO L87 Difference]: Start difference. First operand 6627 states and 24245 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:11,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:11,280 INFO L93 Difference]: Finished difference Result 12473 states and 44443 transitions. [2025-04-13 23:30:11,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:30:11,280 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:11,280 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:11,381 INFO L225 Difference]: With dead ends: 12473 [2025-04-13 23:30:11,382 INFO L226 Difference]: Without dead ends: 12405 [2025-04-13 23:30:11,384 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:30:11,384 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 286 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 100 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 23:30:11,384 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 100 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:30:11,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12405 states. [2025-04-13 23:30:11,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12405 to 6657. [2025-04-13 23:30:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6657 states, 6656 states have (on average 3.6568509615384617) internal successors, (24340), 6656 states have internal predecessors, (24340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:11,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6657 states to 6657 states and 24340 transitions. [2025-04-13 23:30:11,527 INFO L79 Accepts]: Start accepts. Automaton has 6657 states and 24340 transitions. Word has length 54 [2025-04-13 23:30:11,528 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:11,528 INFO L485 AbstractCegarLoop]: Abstraction has 6657 states and 24340 transitions. [2025-04-13 23:30:11,528 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:11,528 INFO L278 IsEmpty]: Start isEmpty. Operand 6657 states and 24340 transitions. [2025-04-13 23:30:11,539 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:11,539 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:11,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 23:30:11,539 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable250 [2025-04-13 23:30:11,539 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 23:30:11,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:11,540 INFO L85 PathProgramCache]: Analyzing trace with hash 710081539, now seen corresponding path program 252 times [2025-04-13 23:30:11,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:11,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977945541] [2025-04-13 23:30:11,540 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:30:11,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:11,543 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:11,553 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:11,553 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:30:11,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:12,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:12,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:12,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977945541] [2025-04-13 23:30:12,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977945541] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:12,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:12,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:12,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581122895] [2025-04-13 23:30:12,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:12,136 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:12,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:12,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:12,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:12,137 INFO L87 Difference]: Start difference. First operand 6657 states and 24340 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:13,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:13,194 INFO L93 Difference]: Finished difference Result 11438 states and 40688 transitions. [2025-04-13 23:30:13,194 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:13,194 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:13,194 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:13,259 INFO L225 Difference]: With dead ends: 11438 [2025-04-13 23:30:13,259 INFO L226 Difference]: Without dead ends: 11370 [2025-04-13 23:30:13,263 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:30:13,263 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 285 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 1621 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:13,263 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 123 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1621 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:30:13,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11370 states. [2025-04-13 23:30:13,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11370 to 6687. [2025-04-13 23:30:13,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6687 states, 6686 states have (on average 3.654651510619204) internal successors, (24435), 6686 states have internal predecessors, (24435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6687 states to 6687 states and 24435 transitions. [2025-04-13 23:30:13,443 INFO L79 Accepts]: Start accepts. Automaton has 6687 states and 24435 transitions. Word has length 54 [2025-04-13 23:30:13,443 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:13,443 INFO L485 AbstractCegarLoop]: Abstraction has 6687 states and 24435 transitions. [2025-04-13 23:30:13,443 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:13,443 INFO L278 IsEmpty]: Start isEmpty. Operand 6687 states and 24435 transitions. [2025-04-13 23:30:13,455 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:13,455 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:13,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 23:30:13,455 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable251 [2025-04-13 23:30:13,455 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 23:30:13,456 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:13,456 INFO L85 PathProgramCache]: Analyzing trace with hash -2069519523, now seen corresponding path program 253 times [2025-04-13 23:30:13,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:13,456 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970642551] [2025-04-13 23:30:13,456 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:30:13,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:13,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:13,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:13,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:30:13,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:14,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 23:30:14,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:14,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970642551] [2025-04-13 23:30:14,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970642551] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:14,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:14,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:14,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438168845] [2025-04-13 23:30:14,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:14,133 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:14,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:14,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:14,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:14,133 INFO L87 Difference]: Start difference. First operand 6687 states and 24435 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:14,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:14,981 INFO L93 Difference]: Finished difference Result 12505 states and 44533 transitions. [2025-04-13 23:30:14,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:14,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 23:30:14,981 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:15,035 INFO L225 Difference]: With dead ends: 12505 [2025-04-13 23:30:15,035 INFO L226 Difference]: Without dead ends: 12425 [2025-04-13 23:30:15,039 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 23:30:15,040 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 276 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:15,040 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 81 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:30:15,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12425 states. [2025-04-13 23:30:15,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12425 to 6677. [2025-04-13 23:30:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6677 states, 6676 states have (on average 3.6548831635710006) internal successors, (24400), 6676 states have internal predecessors, (24400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6677 states to 6677 states and 24400 transitions. [2025-04-13 23:30:15,210 INFO L79 Accepts]: Start accepts. Automaton has 6677 states and 24400 transitions. Word has length 54 [2025-04-13 23:30:15,211 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:15,211 INFO L485 AbstractCegarLoop]: Abstraction has 6677 states and 24400 transitions. [2025-04-13 23:30:15,211 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:15,211 INFO L278 IsEmpty]: Start isEmpty. Operand 6677 states and 24400 transitions. [2025-04-13 23:30:15,222 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:15,222 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:15,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 23:30:15,222 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable252 [2025-04-13 23:30:15,222 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 23:30:15,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:15,223 INFO L85 PathProgramCache]: Analyzing trace with hash -89923037, now seen corresponding path program 254 times [2025-04-13 23:30:15,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:15,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117131135] [2025-04-13 23:30:15,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:30:15,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:15,226 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:15,238 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:15,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:30:15,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:15,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:15,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:15,868 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117131135] [2025-04-13 23:30:15,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117131135] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:15,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:15,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:15,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670223616] [2025-04-13 23:30:15,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:15,868 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:15,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:15,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:15,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:15,869 INFO L87 Difference]: Start difference. First operand 6677 states and 24400 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:16,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:16,893 INFO L93 Difference]: Finished difference Result 11431 states and 40650 transitions. [2025-04-13 23:30:16,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:16,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 23:30:16,893 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:16,939 INFO L225 Difference]: With dead ends: 11431 [2025-04-13 23:30:16,939 INFO L226 Difference]: Without dead ends: 11350 [2025-04-13 23:30:16,943 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:30:16,943 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 313 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:16,943 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 116 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:30:16,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11350 states. [2025-04-13 23:30:17,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11350 to 6667. [2025-04-13 23:30:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6667 states, 6666 states have (on average 3.655115511551155) internal successors, (24365), 6666 states have internal predecessors, (24365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:17,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6667 states to 6667 states and 24365 transitions. [2025-04-13 23:30:17,109 INFO L79 Accepts]: Start accepts. Automaton has 6667 states and 24365 transitions. Word has length 54 [2025-04-13 23:30:17,109 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:17,109 INFO L485 AbstractCegarLoop]: Abstraction has 6667 states and 24365 transitions. [2025-04-13 23:30:17,109 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:17,109 INFO L278 IsEmpty]: Start isEmpty. Operand 6667 states and 24365 transitions. [2025-04-13 23:30:17,120 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:17,120 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:17,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 23:30:17,120 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253 [2025-04-13 23:30:17,121 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 23:30:17,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:17,121 INFO L85 PathProgramCache]: Analyzing trace with hash -461204341, now seen corresponding path program 255 times [2025-04-13 23:30:17,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:17,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623625340] [2025-04-13 23:30:17,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:30:17,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:17,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:17,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:17,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:30:17,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:17,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 23:30:17,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:17,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623625340] [2025-04-13 23:30:17,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623625340] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:17,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:17,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:17,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240068815] [2025-04-13 23:30:17,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:17,799 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:17,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:17,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:17,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:17,799 INFO L87 Difference]: Start difference. First operand 6667 states and 24365 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:18,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:18,723 INFO L93 Difference]: Finished difference Result 12415 states and 44285 transitions. [2025-04-13 23:30:18,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:18,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 23:30:18,724 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:18,775 INFO L225 Difference]: With dead ends: 12415 [2025-04-13 23:30:18,775 INFO L226 Difference]: Without dead ends: 12091 [2025-04-13 23:30:18,780 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 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 23:30:18,780 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 245 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:18,780 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 101 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:30:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12091 states. [2025-04-13 23:30:18,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12091 to 6457. [2025-04-13 23:30:18,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6457 states, 6456 states have (on average 3.6734820322180917) internal successors, (23716), 6456 states have internal predecessors, (23716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6457 states to 6457 states and 23716 transitions. [2025-04-13 23:30:18,948 INFO L79 Accepts]: Start accepts. Automaton has 6457 states and 23716 transitions. Word has length 54 [2025-04-13 23:30:18,948 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:18,948 INFO L485 AbstractCegarLoop]: Abstraction has 6457 states and 23716 transitions. [2025-04-13 23:30:18,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 23:30:18,948 INFO L278 IsEmpty]: Start isEmpty. Operand 6457 states and 23716 transitions. [2025-04-13 23:30:18,959 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:18,959 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:18,959 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:18,959 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable254 [2025-04-13 23:30:18,959 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 23:30:18,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:18,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1624441381, now seen corresponding path program 256 times [2025-04-13 23:30:18,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:18,960 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535450032] [2025-04-13 23:30:18,960 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:30:18,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:18,962 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:30:18,975 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 23:30:18,975 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:30:18,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:19,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:19,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:19,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535450032] [2025-04-13 23:30:19,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535450032] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:19,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:19,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 23:30:19,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128014258] [2025-04-13 23:30:19,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:19,600 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:30:19,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:19,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:30:19,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:30:19,600 INFO L87 Difference]: Start difference. First operand 6457 states and 23716 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:21,179 INFO L93 Difference]: Finished difference Result 12836 states and 45264 transitions. [2025-04-13 23:30:21,180 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 23:30:21,180 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:21,180 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:21,231 INFO L225 Difference]: With dead ends: 12836 [2025-04-13 23:30:21,232 INFO L226 Difference]: Without dead ends: 12553 [2025-04-13 23:30:21,236 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=337, Invalid=719, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:30:21,236 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 437 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 1678 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:21,236 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 128 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1678 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:30:21,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12553 states. [2025-04-13 23:30:21,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12553 to 6397. [2025-04-13 23:30:21,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6397 states, 6396 states have (on average 3.6766729205753594) internal successors, (23516), 6396 states have internal predecessors, (23516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6397 states to 6397 states and 23516 transitions. [2025-04-13 23:30:21,407 INFO L79 Accepts]: Start accepts. Automaton has 6397 states and 23516 transitions. Word has length 54 [2025-04-13 23:30:21,407 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:21,407 INFO L485 AbstractCegarLoop]: Abstraction has 6397 states and 23516 transitions. [2025-04-13 23:30:21,407 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:21,407 INFO L278 IsEmpty]: Start isEmpty. Operand 6397 states and 23516 transitions. [2025-04-13 23:30:21,418 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:21,418 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:21,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:21,418 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable255 [2025-04-13 23:30:21,418 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 23:30:21,418 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:21,418 INFO L85 PathProgramCache]: Analyzing trace with hash -84565861, now seen corresponding path program 257 times [2025-04-13 23:30:21,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:21,418 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830186234] [2025-04-13 23:30:21,419 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:30:21,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:21,421 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:21,431 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:21,431 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:30:21,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:21,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:21,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830186234] [2025-04-13 23:30:21,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830186234] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:21,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:21,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:21,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989224522] [2025-04-13 23:30:21,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:21,996 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:21,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:21,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:21,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:21,996 INFO L87 Difference]: Start difference. First operand 6397 states and 23516 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:22,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:22,976 INFO L93 Difference]: Finished difference Result 13359 states and 47267 transitions. [2025-04-13 23:30:22,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:22,976 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:22,976 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:23,037 INFO L225 Difference]: With dead ends: 13359 [2025-04-13 23:30:23,037 INFO L226 Difference]: Without dead ends: 13242 [2025-04-13 23:30:23,042 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 23:30:23,042 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 304 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:23,042 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 129 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1664 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:30:23,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13242 states. [2025-04-13 23:30:23,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13242 to 6604. [2025-04-13 23:30:23,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6604 states, 6603 states have (on average 3.659245797364834) internal successors, (24162), 6603 states have internal predecessors, (24162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:23,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6604 states to 6604 states and 24162 transitions. [2025-04-13 23:30:23,222 INFO L79 Accepts]: Start accepts. Automaton has 6604 states and 24162 transitions. Word has length 54 [2025-04-13 23:30:23,223 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:23,223 INFO L485 AbstractCegarLoop]: Abstraction has 6604 states and 24162 transitions. [2025-04-13 23:30:23,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 23:30:23,223 INFO L278 IsEmpty]: Start isEmpty. Operand 6604 states and 24162 transitions. [2025-04-13 23:30:23,233 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:23,233 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:23,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 23:30:23,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable256 [2025-04-13 23:30:23,234 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 23:30:23,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:23,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1194701341, now seen corresponding path program 258 times [2025-04-13 23:30:23,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:23,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441562218] [2025-04-13 23:30:23,234 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:30:23,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:23,237 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:23,249 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:23,249 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:30:23,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:23,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:23,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:23,875 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441562218] [2025-04-13 23:30:23,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441562218] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:23,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:23,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:23,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519256227] [2025-04-13 23:30:23,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:23,875 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:23,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:23,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:23,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:23,875 INFO L87 Difference]: Start difference. First operand 6604 states and 24162 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:24,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:24,904 INFO L93 Difference]: Finished difference Result 11626 states and 41212 transitions. [2025-04-13 23:30:24,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:24,904 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:24,904 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:24,955 INFO L225 Difference]: With dead ends: 11626 [2025-04-13 23:30:24,955 INFO L226 Difference]: Without dead ends: 11558 [2025-04-13 23:30:24,959 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:30:24,959 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 324 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:24,959 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 118 Invalid, 1594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:30:24,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11558 states. [2025-04-13 23:30:25,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11558 to 6644. [2025-04-13 23:30:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6644 states, 6643 states have (on average 3.6575342465753424) internal successors, (24297), 6643 states have internal predecessors, (24297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:25,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6644 states to 6644 states and 24297 transitions. [2025-04-13 23:30:25,133 INFO L79 Accepts]: Start accepts. Automaton has 6644 states and 24297 transitions. Word has length 54 [2025-04-13 23:30:25,133 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:25,133 INFO L485 AbstractCegarLoop]: Abstraction has 6644 states and 24297 transitions. [2025-04-13 23:30:25,133 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:25,133 INFO L278 IsEmpty]: Start isEmpty. Operand 6644 states and 24297 transitions. [2025-04-13 23:30:25,144 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:25,144 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:25,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:25,144 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable257 [2025-04-13 23:30:25,144 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 23:30:25,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:25,144 INFO L85 PathProgramCache]: Analyzing trace with hash -287194887, now seen corresponding path program 259 times [2025-04-13 23:30:25,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:25,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370963310] [2025-04-13 23:30:25,144 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:30:25,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:25,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:25,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:25,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:30:25,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:25,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 23:30:25,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:25,768 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370963310] [2025-04-13 23:30:25,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370963310] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:25,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:25,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:25,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968250846] [2025-04-13 23:30:25,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:25,769 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:25,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:25,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:25,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:25,769 INFO L87 Difference]: Start difference. First operand 6644 states and 24297 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:26,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:26,723 INFO L93 Difference]: Finished difference Result 13434 states and 47462 transitions. [2025-04-13 23:30:26,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:26,723 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:26,723 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:26,780 INFO L225 Difference]: With dead ends: 13434 [2025-04-13 23:30:26,781 INFO L226 Difference]: Without dead ends: 13363 [2025-04-13 23:30:26,786 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 23:30:26,786 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 340 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:26,786 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 125 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1586 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:30:26,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13363 states. [2025-04-13 23:30:26,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13363 to 6655. [2025-04-13 23:30:26,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6655 states, 6654 states have (on average 3.6555455365193867) internal successors, (24324), 6654 states have internal predecessors, (24324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:26,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6655 states to 6655 states and 24324 transitions. [2025-04-13 23:30:26,973 INFO L79 Accepts]: Start accepts. Automaton has 6655 states and 24324 transitions. Word has length 54 [2025-04-13 23:30:26,973 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:26,973 INFO L485 AbstractCegarLoop]: Abstraction has 6655 states and 24324 transitions. [2025-04-13 23:30:26,973 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:26,973 INFO L278 IsEmpty]: Start isEmpty. Operand 6655 states and 24324 transitions. [2025-04-13 23:30:26,984 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:26,984 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:26,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 23:30:26,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable258 [2025-04-13 23:30:26,985 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 23:30:26,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:26,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1994705917, now seen corresponding path program 260 times [2025-04-13 23:30:26,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:26,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359846247] [2025-04-13 23:30:26,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:30:26,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:26,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:26,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:27,000 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:30:27,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:27,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:27,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359846247] [2025-04-13 23:30:27,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359846247] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:27,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:27,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:27,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766772796] [2025-04-13 23:30:27,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:27,589 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:27,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:27,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:27,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:27,589 INFO L87 Difference]: Start difference. First operand 6655 states and 24324 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:28,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:28,593 INFO L93 Difference]: Finished difference Result 11569 states and 41056 transitions. [2025-04-13 23:30:28,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:28,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 23:30:28,593 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:28,643 INFO L225 Difference]: With dead ends: 11569 [2025-04-13 23:30:28,643 INFO L226 Difference]: Without dead ends: 11488 [2025-04-13 23:30:28,647 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:30:28,648 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 316 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:28,648 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 103 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:30:28,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11488 states. [2025-04-13 23:30:28,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11488 to 6645. [2025-04-13 23:30:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6645 states, 6644 states have (on average 3.6557796508127636) internal successors, (24289), 6644 states have internal predecessors, (24289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:28,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6645 states to 6645 states and 24289 transitions. [2025-04-13 23:30:28,816 INFO L79 Accepts]: Start accepts. Automaton has 6645 states and 24289 transitions. Word has length 54 [2025-04-13 23:30:28,816 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:28,816 INFO L485 AbstractCegarLoop]: Abstraction has 6645 states and 24289 transitions. [2025-04-13 23:30:28,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 23:30:28,816 INFO L278 IsEmpty]: Start isEmpty. Operand 6645 states and 24289 transitions. [2025-04-13 23:30:28,827 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:28,827 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:28,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 23:30:28,827 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable259 [2025-04-13 23:30:28,827 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 23:30:28,827 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:28,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1822024859, now seen corresponding path program 261 times [2025-04-13 23:30:28,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:28,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713221794] [2025-04-13 23:30:28,828 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:30:28,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:28,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:28,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:28,841 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:30:28,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:29,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:29,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:29,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713221794] [2025-04-13 23:30:29,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713221794] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:29,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:29,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:29,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7193110] [2025-04-13 23:30:29,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:29,430 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:29,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:29,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:29,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:29,431 INFO L87 Difference]: Start difference. First operand 6645 states and 24289 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:30,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:30,331 INFO L93 Difference]: Finished difference Result 13353 states and 47236 transitions. [2025-04-13 23:30:30,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:30,331 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:30,331 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:30,384 INFO L225 Difference]: With dead ends: 13353 [2025-04-13 23:30:30,384 INFO L226 Difference]: Without dead ends: 13250 [2025-04-13 23:30:30,388 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 23:30:30,388 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 337 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:30,389 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 104 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:30:30,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13250 states. [2025-04-13 23:30:30,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13250 to 6612. [2025-04-13 23:30:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6612 states, 6611 states have (on average 3.6584480411435485) internal successors, (24186), 6611 states have internal predecessors, (24186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6612 states to 6612 states and 24186 transitions. [2025-04-13 23:30:30,592 INFO L79 Accepts]: Start accepts. Automaton has 6612 states and 24186 transitions. Word has length 54 [2025-04-13 23:30:30,592 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:30,592 INFO L485 AbstractCegarLoop]: Abstraction has 6612 states and 24186 transitions. [2025-04-13 23:30:30,593 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:30,593 INFO L278 IsEmpty]: Start isEmpty. Operand 6612 states and 24186 transitions. [2025-04-13 23:30:30,603 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:30,603 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:30,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:30,604 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable260 [2025-04-13 23:30:30,604 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 23:30:30,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:30,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1419660763, now seen corresponding path program 262 times [2025-04-13 23:30:30,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:30,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214585984] [2025-04-13 23:30:30,604 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:30:30,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:30,607 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:30:30,619 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 23:30:30,619 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:30:30,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:31,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 23:30:31,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:31,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214585984] [2025-04-13 23:30:31,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214585984] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:31,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:31,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:31,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477803994] [2025-04-13 23:30:31,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:31,216 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:31,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:31,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:31,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:31,216 INFO L87 Difference]: Start difference. First operand 6612 states and 24186 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:32,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:32,244 INFO L93 Difference]: Finished difference Result 11563 states and 41031 transitions. [2025-04-13 23:30:32,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:32,244 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:32,245 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:32,296 INFO L225 Difference]: With dead ends: 11563 [2025-04-13 23:30:32,296 INFO L226 Difference]: Without dead ends: 11435 [2025-04-13 23:30:32,300 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 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 23:30:32,301 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 286 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:32,301 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 120 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:30:32,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11435 states. [2025-04-13 23:30:32,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11435 to 6592. [2025-04-13 23:30:32,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6592 states, 6591 states have (on average 3.658928842360795) internal successors, (24116), 6591 states have internal predecessors, (24116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6592 states to 6592 states and 24116 transitions. [2025-04-13 23:30:32,470 INFO L79 Accepts]: Start accepts. Automaton has 6592 states and 24116 transitions. Word has length 54 [2025-04-13 23:30:32,470 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:32,470 INFO L485 AbstractCegarLoop]: Abstraction has 6592 states and 24116 transitions. [2025-04-13 23:30:32,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 23:30:32,471 INFO L278 IsEmpty]: Start isEmpty. Operand 6592 states and 24116 transitions. [2025-04-13 23:30:32,481 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:32,481 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:32,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:32,481 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261 [2025-04-13 23:30:32,481 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 23:30:32,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:32,482 INFO L85 PathProgramCache]: Analyzing trace with hash -232857381, now seen corresponding path program 263 times [2025-04-13 23:30:32,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:32,482 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927155504] [2025-04-13 23:30:32,482 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:30:32,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:32,484 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:32,495 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:32,496 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:30:32,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:33,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:33,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:33,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927155504] [2025-04-13 23:30:33,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927155504] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:33,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:33,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:33,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248324751] [2025-04-13 23:30:33,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:33,138 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:33,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:33,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:33,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:33,138 INFO L87 Difference]: Start difference. First operand 6592 states and 24116 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:33,969 INFO L93 Difference]: Finished difference Result 13322 states and 47128 transitions. [2025-04-13 23:30:33,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:33,969 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:33,969 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:34,025 INFO L225 Difference]: With dead ends: 13322 [2025-04-13 23:30:34,026 INFO L226 Difference]: Without dead ends: 13251 [2025-04-13 23:30:34,031 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:30:34,031 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 332 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:34,031 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 101 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:30:34,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13251 states. [2025-04-13 23:30:34,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13251 to 6625. [2025-04-13 23:30:34,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6625 states, 6624 states have (on average 3.65625) internal successors, (24219), 6624 states have internal predecessors, (24219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6625 states to 6625 states and 24219 transitions. [2025-04-13 23:30:34,212 INFO L79 Accepts]: Start accepts. Automaton has 6625 states and 24219 transitions. Word has length 54 [2025-04-13 23:30:34,212 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:34,212 INFO L485 AbstractCegarLoop]: Abstraction has 6625 states and 24219 transitions. [2025-04-13 23:30:34,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 23:30:34,213 INFO L278 IsEmpty]: Start isEmpty. Operand 6625 states and 24219 transitions. [2025-04-13 23:30:34,223 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:34,223 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:34,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:34,224 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable262 [2025-04-13 23:30:34,224 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 23:30:34,224 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:34,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1394797061, now seen corresponding path program 264 times [2025-04-13 23:30:34,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:34,224 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793299055] [2025-04-13 23:30:34,224 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:30:34,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:34,227 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:34,238 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:34,238 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:30:34,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:34,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:34,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:34,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793299055] [2025-04-13 23:30:34,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793299055] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:34,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:34,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:34,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296233734] [2025-04-13 23:30:34,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:34,852 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:34,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:34,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:34,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:34,852 INFO L87 Difference]: Start difference. First operand 6625 states and 24219 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:35,897 INFO L93 Difference]: Finished difference Result 11632 states and 41215 transitions. [2025-04-13 23:30:35,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:35,898 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:35,898 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:35,948 INFO L225 Difference]: With dead ends: 11632 [2025-04-13 23:30:35,948 INFO L226 Difference]: Without dead ends: 11564 [2025-04-13 23:30:35,951 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:30:35,951 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 308 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 1658 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:35,951 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 127 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1658 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:30:35,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11564 states. [2025-04-13 23:30:36,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11564 to 6640. [2025-04-13 23:30:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6640 states, 6639 states have (on average 3.6547672842295524) internal successors, (24264), 6639 states have internal predecessors, (24264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6640 states to 6640 states and 24264 transitions. [2025-04-13 23:30:36,126 INFO L79 Accepts]: Start accepts. Automaton has 6640 states and 24264 transitions. Word has length 54 [2025-04-13 23:30:36,127 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:36,127 INFO L485 AbstractCegarLoop]: Abstraction has 6640 states and 24264 transitions. [2025-04-13 23:30:36,127 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:36,127 INFO L278 IsEmpty]: Start isEmpty. Operand 6640 states and 24264 transitions. [2025-04-13 23:30:36,139 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:36,139 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:36,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:36,139 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable263 [2025-04-13 23:30:36,139 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 23:30:36,139 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:36,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1767687353, now seen corresponding path program 265 times [2025-04-13 23:30:36,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:36,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182136680] [2025-04-13 23:30:36,140 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:30:36,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:36,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:36,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:36,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:30:36,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:36,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 23:30:36,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:36,743 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182136680] [2025-04-13 23:30:36,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182136680] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:36,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:36,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:36,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888408259] [2025-04-13 23:30:36,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:36,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:36,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:36,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:36,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:36,744 INFO L87 Difference]: Start difference. First operand 6640 states and 24264 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:37,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:37,624 INFO L93 Difference]: Finished difference Result 13336 states and 47160 transitions. [2025-04-13 23:30:37,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:37,625 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:37,625 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:37,683 INFO L225 Difference]: With dead ends: 13336 [2025-04-13 23:30:37,683 INFO L226 Difference]: Without dead ends: 13255 [2025-04-13 23:30:37,688 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:30:37,688 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 346 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:37,688 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 105 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:30:37,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13255 states. [2025-04-13 23:30:37,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13255 to 6629. [2025-04-13 23:30:37,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6629 states, 6628 states have (on average 3.6550995775497888) internal successors, (24226), 6628 states have internal predecessors, (24226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6629 states to 6629 states and 24226 transitions. [2025-04-13 23:30:37,859 INFO L79 Accepts]: Start accepts. Automaton has 6629 states and 24226 transitions. Word has length 54 [2025-04-13 23:30:37,860 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:37,860 INFO L485 AbstractCegarLoop]: Abstraction has 6629 states and 24226 transitions. [2025-04-13 23:30:37,860 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:37,860 INFO L278 IsEmpty]: Start isEmpty. Operand 6629 states and 24226 transitions. [2025-04-13 23:30:37,870 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:37,870 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:37,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:37,870 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable264 [2025-04-13 23:30:37,870 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 23:30:37,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:37,870 INFO L85 PathProgramCache]: Analyzing trace with hash 594792485, now seen corresponding path program 266 times [2025-04-13 23:30:37,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:37,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352944720] [2025-04-13 23:30:37,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:30:37,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:37,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:37,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:37,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:30:37,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:38,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 23:30:38,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:38,506 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352944720] [2025-04-13 23:30:38,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352944720] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:38,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:38,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:38,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905373631] [2025-04-13 23:30:38,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:38,506 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:38,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:38,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:38,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:38,506 INFO L87 Difference]: Start difference. First operand 6629 states and 24226 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:39,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:39,563 INFO L93 Difference]: Finished difference Result 11624 states and 41174 transitions. [2025-04-13 23:30:39,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:39,563 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:39,563 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:39,615 INFO L225 Difference]: With dead ends: 11624 [2025-04-13 23:30:39,615 INFO L226 Difference]: Without dead ends: 11543 [2025-04-13 23:30:39,619 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:30:39,620 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 307 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 1722 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:39,620 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 135 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1722 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:30:39,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11543 states. [2025-04-13 23:30:39,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11543 to 6619. [2025-04-13 23:30:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6619 states, 6618 states have (on average 3.6560894530069508) internal successors, (24196), 6618 states have internal predecessors, (24196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6619 states to 6619 states and 24196 transitions. [2025-04-13 23:30:39,829 INFO L79 Accepts]: Start accepts. Automaton has 6619 states and 24196 transitions. Word has length 54 [2025-04-13 23:30:39,830 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:39,830 INFO L485 AbstractCegarLoop]: Abstraction has 6619 states and 24196 transitions. [2025-04-13 23:30:39,830 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:39,830 INFO L278 IsEmpty]: Start isEmpty. Operand 6619 states and 24196 transitions. [2025-04-13 23:30:39,840 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:39,841 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:39,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:39,841 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable265 [2025-04-13 23:30:39,841 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 23:30:39,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:39,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1635105237, now seen corresponding path program 267 times [2025-04-13 23:30:39,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:39,841 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881665033] [2025-04-13 23:30:39,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:30:39,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:39,844 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:39,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:39,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:30:39,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:40,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:40,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881665033] [2025-04-13 23:30:40,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881665033] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:40,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:40,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:40,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963489951] [2025-04-13 23:30:40,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:40,447 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:40,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:40,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:40,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:40,447 INFO L87 Difference]: Start difference. First operand 6619 states and 24196 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:41,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:41,303 INFO L93 Difference]: Finished difference Result 13245 states and 46914 transitions. [2025-04-13 23:30:41,304 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:41,304 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:41,304 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:41,369 INFO L225 Difference]: With dead ends: 13245 [2025-04-13 23:30:41,369 INFO L226 Difference]: Without dead ends: 12966 [2025-04-13 23:30:41,375 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 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 23:30:41,375 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 328 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:41,375 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 99 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:30:41,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12966 states. [2025-04-13 23:30:41,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12966 to 6454. [2025-04-13 23:30:41,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6454 states, 6453 states have (on average 3.6702309003564233) internal successors, (23684), 6453 states have internal predecessors, (23684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6454 states to 6454 states and 23684 transitions. [2025-04-13 23:30:41,550 INFO L79 Accepts]: Start accepts. Automaton has 6454 states and 23684 transitions. Word has length 54 [2025-04-13 23:30:41,550 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:41,550 INFO L485 AbstractCegarLoop]: Abstraction has 6454 states and 23684 transitions. [2025-04-13 23:30:41,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:41,550 INFO L278 IsEmpty]: Start isEmpty. Operand 6454 states and 23684 transitions. [2025-04-13 23:30:41,561 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:41,561 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:41,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:41,561 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable266 [2025-04-13 23:30:41,561 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 23:30:41,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:41,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1979594269, now seen corresponding path program 268 times [2025-04-13 23:30:41,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:41,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506642744] [2025-04-13 23:30:41,561 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:30:41,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:41,564 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:30:41,576 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 23:30:41,576 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:30:41,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:42,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:42,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:42,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506642744] [2025-04-13 23:30:42,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506642744] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:42,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:42,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:42,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639611350] [2025-04-13 23:30:42,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:42,195 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:42,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:42,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:42,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:42,195 INFO L87 Difference]: Start difference. First operand 6454 states and 23684 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:43,204 INFO L93 Difference]: Finished difference Result 11458 states and 40665 transitions. [2025-04-13 23:30:43,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:43,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 23:30:43,205 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:43,256 INFO L225 Difference]: With dead ends: 11458 [2025-04-13 23:30:43,256 INFO L226 Difference]: Without dead ends: 11390 [2025-04-13 23:30:43,260 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:30:43,260 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 304 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:43,260 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 120 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:30:43,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11390 states. [2025-04-13 23:30:43,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11390 to 6464. [2025-04-13 23:30:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6464 states, 6463 states have (on average 3.668420238279437) internal successors, (23709), 6463 states have internal predecessors, (23709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6464 states to 6464 states and 23709 transitions. [2025-04-13 23:30:43,427 INFO L79 Accepts]: Start accepts. Automaton has 6464 states and 23709 transitions. Word has length 54 [2025-04-13 23:30:43,427 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:43,427 INFO L485 AbstractCegarLoop]: Abstraction has 6464 states and 23709 transitions. [2025-04-13 23:30:43,427 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:43,427 INFO L278 IsEmpty]: Start isEmpty. Operand 6464 states and 23709 transitions. [2025-04-13 23:30:43,437 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:43,437 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:43,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:43,438 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable267 [2025-04-13 23:30:43,438 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 23:30:43,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:43,438 INFO L85 PathProgramCache]: Analyzing trace with hash -195533473, now seen corresponding path program 269 times [2025-04-13 23:30:43,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:43,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880320736] [2025-04-13 23:30:43,438 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:30:43,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:43,441 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:43,451 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:43,451 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:30:43,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:44,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 23:30:44,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:44,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880320736] [2025-04-13 23:30:44,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880320736] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:44,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:44,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:44,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869460480] [2025-04-13 23:30:44,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:44,080 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:44,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:44,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:44,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:44,080 INFO L87 Difference]: Start difference. First operand 6464 states and 23709 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:45,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:45,022 INFO L93 Difference]: Finished difference Result 13322 states and 47152 transitions. [2025-04-13 23:30:45,022 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:45,022 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:45,023 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:45,073 INFO L225 Difference]: With dead ends: 13322 [2025-04-13 23:30:45,074 INFO L226 Difference]: Without dead ends: 13251 [2025-04-13 23:30:45,078 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 23:30:45,078 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 370 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1576 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:45,078 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 115 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1576 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:30:45,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13251 states. [2025-04-13 23:30:45,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13251 to 6539. [2025-04-13 23:30:45,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6539 states, 6538 states have (on average 3.666870602630774) internal successors, (23974), 6538 states have internal predecessors, (23974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:45,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6539 states to 6539 states and 23974 transitions. [2025-04-13 23:30:45,251 INFO L79 Accepts]: Start accepts. Automaton has 6539 states and 23974 transitions. Word has length 54 [2025-04-13 23:30:45,251 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:45,251 INFO L485 AbstractCegarLoop]: Abstraction has 6539 states and 23974 transitions. [2025-04-13 23:30:45,251 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:45,251 INFO L278 IsEmpty]: Start isEmpty. Operand 6539 states and 23974 transitions. [2025-04-13 23:30:45,262 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:45,262 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:45,262 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:45,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable268 [2025-04-13 23:30:45,262 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 23:30:45,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:45,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1544895045, now seen corresponding path program 270 times [2025-04-13 23:30:45,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:45,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912767569] [2025-04-13 23:30:45,263 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:30:45,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:45,265 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:45,277 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:45,277 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:30:45,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:45,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:45,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:45,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912767569] [2025-04-13 23:30:45,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912767569] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:45,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:45,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:45,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834550139] [2025-04-13 23:30:45,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:45,879 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:45,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:45,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:45,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:45,879 INFO L87 Difference]: Start difference. First operand 6539 states and 23974 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:46,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:46,946 INFO L93 Difference]: Finished difference Result 11487 states and 40812 transitions. [2025-04-13 23:30:46,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:46,946 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:46,946 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:46,993 INFO L225 Difference]: With dead ends: 11487 [2025-04-13 23:30:46,993 INFO L226 Difference]: Without dead ends: 11407 [2025-04-13 23:30:46,997 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:30:46,997 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 266 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:46,997 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 124 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:30:47,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11407 states. [2025-04-13 23:30:47,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11407 to 6529. [2025-04-13 23:30:47,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6529 states, 6528 states have (on average 3.667892156862745) internal successors, (23944), 6528 states have internal predecessors, (23944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6529 states to 6529 states and 23944 transitions. [2025-04-13 23:30:47,153 INFO L79 Accepts]: Start accepts. Automaton has 6529 states and 23944 transitions. Word has length 54 [2025-04-13 23:30:47,153 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:47,153 INFO L485 AbstractCegarLoop]: Abstraction has 6529 states and 23944 transitions. [2025-04-13 23:30:47,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 23:30:47,153 INFO L278 IsEmpty]: Start isEmpty. Operand 6529 states and 23944 transitions. [2025-04-13 23:30:47,164 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:47,164 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:47,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:47,164 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable269 [2025-04-13 23:30:47,164 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 23:30:47,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:47,164 INFO L85 PathProgramCache]: Analyzing trace with hash 604471103, now seen corresponding path program 271 times [2025-04-13 23:30:47,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:47,164 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777094865] [2025-04-13 23:30:47,165 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:30:47,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:47,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:47,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:47,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:30:47,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:47,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 23:30:47,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:47,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777094865] [2025-04-13 23:30:47,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777094865] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:47,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:47,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:47,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655742170] [2025-04-13 23:30:47,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:47,742 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:47,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:47,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:47,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:47,742 INFO L87 Difference]: Start difference. First operand 6529 states and 23944 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:48,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:48,651 INFO L93 Difference]: Finished difference Result 13241 states and 46932 transitions. [2025-04-13 23:30:48,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:48,651 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:48,652 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:48,709 INFO L225 Difference]: With dead ends: 13241 [2025-04-13 23:30:48,709 INFO L226 Difference]: Without dead ends: 13163 [2025-04-13 23:30:48,714 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 23:30:48,714 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 317 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:48,714 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 109 Invalid, 1488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:30:48,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13163 states. [2025-04-13 23:30:48,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13163 to 6519. [2025-04-13 23:30:48,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6519 states, 6518 states have (on average 3.6681497391837987) internal successors, (23909), 6518 states have internal predecessors, (23909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:48,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6519 states to 6519 states and 23909 transitions. [2025-04-13 23:30:48,885 INFO L79 Accepts]: Start accepts. Automaton has 6519 states and 23909 transitions. Word has length 54 [2025-04-13 23:30:48,885 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:48,885 INFO L485 AbstractCegarLoop]: Abstraction has 6519 states and 23909 transitions. [2025-04-13 23:30:48,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 23:30:48,885 INFO L278 IsEmpty]: Start isEmpty. Operand 6519 states and 23909 transitions. [2025-04-13 23:30:48,896 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:48,896 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:48,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:48,896 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable270 [2025-04-13 23:30:48,896 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 23:30:48,896 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:48,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1815188477, now seen corresponding path program 272 times [2025-04-13 23:30:48,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:48,896 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076756483] [2025-04-13 23:30:48,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:30:48,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:48,923 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:48,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:48,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:30:48,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:49,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:49,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076756483] [2025-04-13 23:30:49,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076756483] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:49,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:49,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:49,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135256950] [2025-04-13 23:30:49,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:49,552 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:49,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:49,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:49,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:49,552 INFO L87 Difference]: Start difference. First operand 6519 states and 23909 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:50,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:50,518 INFO L93 Difference]: Finished difference Result 11423 states and 40617 transitions. [2025-04-13 23:30:50,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:50,518 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:50,518 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:50,570 INFO L225 Difference]: With dead ends: 11423 [2025-04-13 23:30:50,570 INFO L226 Difference]: Without dead ends: 11352 [2025-04-13 23:30:50,574 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:30:50,574 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 281 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:50,574 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 113 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:30:50,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11352 states. [2025-04-13 23:30:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11352 to 6530. [2025-04-13 23:30:50,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6530 states, 6529 states have (on average 3.6661050696890793) internal successors, (23936), 6529 states have internal predecessors, (23936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:50,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6530 states to 6530 states and 23936 transitions. [2025-04-13 23:30:50,726 INFO L79 Accepts]: Start accepts. Automaton has 6530 states and 23936 transitions. Word has length 54 [2025-04-13 23:30:50,727 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:50,727 INFO L485 AbstractCegarLoop]: Abstraction has 6530 states and 23936 transitions. [2025-04-13 23:30:50,727 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:50,727 INFO L278 IsEmpty]: Start isEmpty. Operand 6530 states and 23936 transitions. [2025-04-13 23:30:50,737 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:50,737 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:50,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:50,737 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable271 [2025-04-13 23:30:50,737 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 23:30:50,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:50,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1518830945, now seen corresponding path program 273 times [2025-04-13 23:30:50,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:50,738 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236922901] [2025-04-13 23:30:50,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:30:50,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:50,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:50,751 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:50,751 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:30:50,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:51,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 23:30:51,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:51,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236922901] [2025-04-13 23:30:51,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236922901] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:51,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:51,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:51,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680299498] [2025-04-13 23:30:51,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:51,376 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:51,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:51,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:51,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:51,376 INFO L87 Difference]: Start difference. First operand 6530 states and 23936 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:52,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:52,401 INFO L93 Difference]: Finished difference Result 13291 states and 47065 transitions. [2025-04-13 23:30:52,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:52,402 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:52,402 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:52,456 INFO L225 Difference]: With dead ends: 13291 [2025-04-13 23:30:52,456 INFO L226 Difference]: Without dead ends: 13154 [2025-04-13 23:30:52,461 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 23:30:52,461 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 291 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1690 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:52,461 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 130 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1690 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:30:52,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13154 states. [2025-04-13 23:30:52,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13154 to 6510. [2025-04-13 23:30:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6510 states, 6509 states have (on average 3.6666154555231216) internal successors, (23866), 6509 states have internal predecessors, (23866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:52,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6510 states to 6510 states and 23866 transitions. [2025-04-13 23:30:52,635 INFO L79 Accepts]: Start accepts. Automaton has 6510 states and 23866 transitions. Word has length 54 [2025-04-13 23:30:52,635 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:52,635 INFO L485 AbstractCegarLoop]: Abstraction has 6510 states and 23866 transitions. [2025-04-13 23:30:52,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 23:30:52,635 INFO L278 IsEmpty]: Start isEmpty. Operand 6510 states and 23866 transitions. [2025-04-13 23:30:52,646 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:52,646 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:52,646 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:52,646 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable272 [2025-04-13 23:30:52,646 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 23:30:52,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:52,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1539643493, now seen corresponding path program 274 times [2025-04-13 23:30:52,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:52,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251587794] [2025-04-13 23:30:52,646 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:30:52,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:52,649 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:30:52,661 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 23:30:52,661 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:30:52,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:53,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:53,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:53,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251587794] [2025-04-13 23:30:53,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251587794] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:53,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:53,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:53,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749952748] [2025-04-13 23:30:53,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:53,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:53,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:53,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:53,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:53,304 INFO L87 Difference]: Start difference. First operand 6510 states and 23866 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:54,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:54,267 INFO L93 Difference]: Finished difference Result 11354 states and 40421 transitions. [2025-04-13 23:30:54,267 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:54,267 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:54,267 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:54,316 INFO L225 Difference]: With dead ends: 11354 [2025-04-13 23:30:54,316 INFO L226 Difference]: Without dead ends: 11268 [2025-04-13 23:30:54,320 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:30:54,321 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 264 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1517 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:54,321 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 111 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1517 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:30:54,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11268 states. [2025-04-13 23:30:54,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11268 to 6494. [2025-04-13 23:30:54,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6494 states, 6493 states have (on average 3.6691821962113047) internal successors, (23824), 6493 states have internal predecessors, (23824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6494 states to 6494 states and 23824 transitions. [2025-04-13 23:30:54,482 INFO L79 Accepts]: Start accepts. Automaton has 6494 states and 23824 transitions. Word has length 54 [2025-04-13 23:30:54,483 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:54,483 INFO L485 AbstractCegarLoop]: Abstraction has 6494 states and 23824 transitions. [2025-04-13 23:30:54,483 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:54,483 INFO L278 IsEmpty]: Start isEmpty. Operand 6494 states and 23824 transitions. [2025-04-13 23:30:54,493 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:54,493 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:54,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:54,493 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable273 [2025-04-13 23:30:54,493 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 23:30:54,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:54,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1821062495, now seen corresponding path program 275 times [2025-04-13 23:30:54,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:54,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900546112] [2025-04-13 23:30:54,494 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:30:54,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:54,496 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:54,507 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:54,507 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:30:54,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:55,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:55,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900546112] [2025-04-13 23:30:55,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900546112] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:55,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:55,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:55,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121433479] [2025-04-13 23:30:55,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:55,093 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:55,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:55,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:55,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:55,093 INFO L87 Difference]: Start difference. First operand 6494 states and 23824 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:56,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:56,094 INFO L93 Difference]: Finished difference Result 13406 states and 47365 transitions. [2025-04-13 23:30:56,094 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:56,094 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:56,094 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:56,148 INFO L225 Difference]: With dead ends: 13406 [2025-04-13 23:30:56,148 INFO L226 Difference]: Without dead ends: 13335 [2025-04-13 23:30:56,152 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 23:30:56,152 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 357 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:56,153 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 120 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:30:56,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13335 states. [2025-04-13 23:30:56,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13335 to 6509. [2025-04-13 23:30:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6509 states, 6508 states have (on average 3.667639827904118) internal successors, (23869), 6508 states have internal predecessors, (23869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:56,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6509 states to 6509 states and 23869 transitions. [2025-04-13 23:30:56,333 INFO L79 Accepts]: Start accepts. Automaton has 6509 states and 23869 transitions. Word has length 54 [2025-04-13 23:30:56,333 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:56,333 INFO L485 AbstractCegarLoop]: Abstraction has 6509 states and 23869 transitions. [2025-04-13 23:30:56,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 23:30:56,334 INFO L278 IsEmpty]: Start isEmpty. Operand 6509 states and 23869 transitions. [2025-04-13 23:30:56,344 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:56,344 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:56,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:56,345 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable274 [2025-04-13 23:30:56,345 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 23:30:56,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:56,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1348390407, now seen corresponding path program 276 times [2025-04-13 23:30:56,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:56,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971815007] [2025-04-13 23:30:56,345 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:30:56,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:56,348 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:56,359 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:56,359 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:30:56,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:56,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:56,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971815007] [2025-04-13 23:30:56,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971815007] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:56,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:56,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:56,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674745053] [2025-04-13 23:30:56,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:56,962 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:56,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:56,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:56,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:56,963 INFO L87 Difference]: Start difference. First operand 6509 states and 23869 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:57,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:57,990 INFO L93 Difference]: Finished difference Result 11319 states and 40319 transitions. [2025-04-13 23:30:57,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:57,990 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:30:57,990 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:58,042 INFO L225 Difference]: With dead ends: 11319 [2025-04-13 23:30:58,042 INFO L226 Difference]: Without dead ends: 11211 [2025-04-13 23:30:58,046 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:30:58,047 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 267 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:58,047 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 129 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:30:58,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11211 states. [2025-04-13 23:30:58,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11211 to 6529. [2025-04-13 23:30:58,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6529 states, 6528 states have (on average 3.6640625) internal successors, (23919), 6528 states have internal predecessors, (23919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6529 states to 6529 states and 23919 transitions. [2025-04-13 23:30:58,285 INFO L79 Accepts]: Start accepts. Automaton has 6529 states and 23919 transitions. Word has length 54 [2025-04-13 23:30:58,286 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:30:58,286 INFO L485 AbstractCegarLoop]: Abstraction has 6529 states and 23919 transitions. [2025-04-13 23:30:58,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 23:30:58,286 INFO L278 IsEmpty]: Start isEmpty. Operand 6529 states and 23919 transitions. [2025-04-13 23:30:58,297 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:30:58,297 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:30:58,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:30:58,297 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable275 [2025-04-13 23:30:58,297 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 23:30:58,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:30:58,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1673900225, now seen corresponding path program 277 times [2025-04-13 23:30:58,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:30:58,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935832163] [2025-04-13 23:30:58,298 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:30:58,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:30:58,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:30:58,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:30:58,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:30:58,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:30:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:30:58,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:30:58,885 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935832163] [2025-04-13 23:30:58,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935832163] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:30:58,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:30:58,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:30:58,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350783580] [2025-04-13 23:30:58,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:30:58,886 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:30:58,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:30:58,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:30:58,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:30:58,886 INFO L87 Difference]: Start difference. First operand 6529 states and 23919 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:30:59,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:30:59,879 INFO L93 Difference]: Finished difference Result 13423 states and 47398 transitions. [2025-04-13 23:30:59,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:30:59,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 23:30:59,880 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:30:59,940 INFO L225 Difference]: With dead ends: 13423 [2025-04-13 23:30:59,940 INFO L226 Difference]: Without dead ends: 13345 [2025-04-13 23:30:59,946 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 23:30:59,946 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 348 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1638 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:30:59,946 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 123 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1638 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:30:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13345 states. [2025-04-13 23:31:00,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13345 to 6519. [2025-04-13 23:31:00,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6519 states, 6518 states have (on average 3.6650813132862843) internal successors, (23889), 6518 states have internal predecessors, (23889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:00,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6519 states to 6519 states and 23889 transitions. [2025-04-13 23:31:00,136 INFO L79 Accepts]: Start accepts. Automaton has 6519 states and 23889 transitions. Word has length 54 [2025-04-13 23:31:00,136 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:00,136 INFO L485 AbstractCegarLoop]: Abstraction has 6519 states and 23889 transitions. [2025-04-13 23:31:00,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 23:31:00,136 INFO L278 IsEmpty]: Start isEmpty. Operand 6519 states and 23889 transitions. [2025-04-13 23:31:00,148 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:00,148 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:00,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 23:31:00,148 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable276 [2025-04-13 23:31:00,148 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 23:31:00,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:00,148 INFO L85 PathProgramCache]: Analyzing trace with hash 877733285, now seen corresponding path program 278 times [2025-04-13 23:31:00,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:00,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146133085] [2025-04-13 23:31:00,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:31:00,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:00,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:00,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:00,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:31:00,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:00,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:00,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:00,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146133085] [2025-04-13 23:31:00,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146133085] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:00,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:00,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:00,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5937023] [2025-04-13 23:31:00,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:00,807 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:00,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:00,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:00,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:00,808 INFO L87 Difference]: Start difference. First operand 6519 states and 23889 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:01,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:01,760 INFO L93 Difference]: Finished difference Result 11281 states and 40189 transitions. [2025-04-13 23:31:01,760 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:01,760 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:31:01,760 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:01,807 INFO L225 Difference]: With dead ends: 11281 [2025-04-13 23:31:01,807 INFO L226 Difference]: Without dead ends: 11213 [2025-04-13 23:31:01,810 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:31:01,811 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 280 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1487 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:01,811 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 113 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1487 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:31:01,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11213 states. [2025-04-13 23:31:01,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11213 to 6529. [2025-04-13 23:31:01,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6529 states, 6528 states have (on average 3.663296568627451) internal successors, (23914), 6528 states have internal predecessors, (23914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:01,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6529 states to 6529 states and 23914 transitions. [2025-04-13 23:31:01,971 INFO L79 Accepts]: Start accepts. Automaton has 6529 states and 23914 transitions. Word has length 54 [2025-04-13 23:31:01,972 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:01,972 INFO L485 AbstractCegarLoop]: Abstraction has 6529 states and 23914 transitions. [2025-04-13 23:31:01,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 23:31:01,972 INFO L278 IsEmpty]: Start isEmpty. Operand 6529 states and 23914 transitions. [2025-04-13 23:31:01,983 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:01,983 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:01,983 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:01,983 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable277 [2025-04-13 23:31:01,983 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 23:31:01,983 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:01,983 INFO L85 PathProgramCache]: Analyzing trace with hash -588918467, now seen corresponding path program 279 times [2025-04-13 23:31:01,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:01,983 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940954766] [2025-04-13 23:31:01,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:31:01,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:01,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:01,997 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:01,997 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:31:01,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:02,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:02,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940954766] [2025-04-13 23:31:02,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940954766] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:02,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:02,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:02,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302109109] [2025-04-13 23:31:02,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:02,620 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:02,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:02,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:02,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:02,621 INFO L87 Difference]: Start difference. First operand 6529 states and 23914 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:03,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:03,605 INFO L93 Difference]: Finished difference Result 13436 states and 47436 transitions. [2025-04-13 23:31:03,605 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:03,605 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:31:03,605 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:03,658 INFO L225 Difference]: With dead ends: 13436 [2025-04-13 23:31:03,658 INFO L226 Difference]: Without dead ends: 13365 [2025-04-13 23:31:03,663 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:31:03,663 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 329 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:03,663 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 121 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:31:03,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13365 states. [2025-04-13 23:31:03,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13365 to 6540. [2025-04-13 23:31:03,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6540 states, 6539 states have (on average 3.661263190090228) internal successors, (23941), 6539 states have internal predecessors, (23941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:03,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6540 states to 6540 states and 23941 transitions. [2025-04-13 23:31:03,839 INFO L79 Accepts]: Start accepts. Automaton has 6540 states and 23941 transitions. Word has length 54 [2025-04-13 23:31:03,839 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:03,839 INFO L485 AbstractCegarLoop]: Abstraction has 6540 states and 23941 transitions. [2025-04-13 23:31:03,839 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:03,840 INFO L278 IsEmpty]: Start isEmpty. Operand 6540 states and 23941 transitions. [2025-04-13 23:31:03,851 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:03,851 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:03,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 23:31:03,851 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable278 [2025-04-13 23:31:03,851 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 23:31:03,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:03,851 INFO L85 PathProgramCache]: Analyzing trace with hash 107255303, now seen corresponding path program 280 times [2025-04-13 23:31:03,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:03,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804572490] [2025-04-13 23:31:03,852 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:31:03,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:03,854 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:31:03,865 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 23:31:03,866 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:31:03,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:04,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:04,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:04,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804572490] [2025-04-13 23:31:04,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804572490] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:04,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:04,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 23:31:04,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813852711] [2025-04-13 23:31:04,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:04,555 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:31:04,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:04,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:31:04,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:31:04,555 INFO L87 Difference]: Start difference. First operand 6540 states and 23941 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:05,735 INFO L93 Difference]: Finished difference Result 12814 states and 45177 transitions. [2025-04-13 23:31:05,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:31:05,735 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:31:05,735 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:05,790 INFO L225 Difference]: With dead ends: 12814 [2025-04-13 23:31:05,790 INFO L226 Difference]: Without dead ends: 12704 [2025-04-13 23:31:05,795 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=275, Invalid=595, Unknown=0, NotChecked=0, Total=870 [2025-04-13 23:31:05,795 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 356 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1736 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:05,795 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 132 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:31:05,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12704 states. [2025-04-13 23:31:05,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12704 to 6500. [2025-04-13 23:31:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6500 states, 6499 states have (on average 3.666871826434836) internal successors, (23831), 6499 states have internal predecessors, (23831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:05,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6500 states to 6500 states and 23831 transitions. [2025-04-13 23:31:05,962 INFO L79 Accepts]: Start accepts. Automaton has 6500 states and 23831 transitions. Word has length 54 [2025-04-13 23:31:05,962 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:05,962 INFO L485 AbstractCegarLoop]: Abstraction has 6500 states and 23831 transitions. [2025-04-13 23:31:05,962 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:05,962 INFO L278 IsEmpty]: Start isEmpty. Operand 6500 states and 23831 transitions. [2025-04-13 23:31:05,973 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:05,973 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:05,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 23:31:05,973 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable279 [2025-04-13 23:31:05,973 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 23:31:05,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:05,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1529053793, now seen corresponding path program 281 times [2025-04-13 23:31:05,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:05,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768232127] [2025-04-13 23:31:05,974 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:31:05,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:05,976 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:05,987 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:05,987 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:31:05,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:06,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:06,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768232127] [2025-04-13 23:31:06,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768232127] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:06,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:06,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:06,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722056945] [2025-04-13 23:31:06,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:06,616 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:06,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:06,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:06,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:06,616 INFO L87 Difference]: Start difference. First operand 6500 states and 23831 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:07,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:07,613 INFO L93 Difference]: Finished difference Result 13347 states and 47200 transitions. [2025-04-13 23:31:07,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:07,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 23:31:07,613 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:07,664 INFO L225 Difference]: With dead ends: 13347 [2025-04-13 23:31:07,665 INFO L226 Difference]: Without dead ends: 13266 [2025-04-13 23:31:07,667 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:31:07,667 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 311 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:07,667 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 109 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:31:07,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13266 states. [2025-04-13 23:31:07,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13266 to 6489. [2025-04-13 23:31:07,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6489 states, 6488 states have (on average 3.6681565967940815) internal successors, (23799), 6488 states have internal predecessors, (23799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:07,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6489 states to 6489 states and 23799 transitions. [2025-04-13 23:31:07,830 INFO L79 Accepts]: Start accepts. Automaton has 6489 states and 23799 transitions. Word has length 54 [2025-04-13 23:31:07,831 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:07,831 INFO L485 AbstractCegarLoop]: Abstraction has 6489 states and 23799 transitions. [2025-04-13 23:31:07,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 23:31:07,831 INFO L278 IsEmpty]: Start isEmpty. Operand 6489 states and 23799 transitions. [2025-04-13 23:31:07,841 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:07,841 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:07,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:07,841 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable280 [2025-04-13 23:31:07,841 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 23:31:07,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:07,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2114525181, now seen corresponding path program 282 times [2025-04-13 23:31:07,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:07,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902905674] [2025-04-13 23:31:07,842 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:31:07,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:07,844 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:07,856 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:07,856 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:31:07,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:08,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 23:31:08,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:08,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902905674] [2025-04-13 23:31:08,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902905674] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:08,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:08,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:08,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697463695] [2025-04-13 23:31:08,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:08,436 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:08,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:08,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:08,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:08,437 INFO L87 Difference]: Start difference. First operand 6489 states and 23799 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:09,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:09,435 INFO L93 Difference]: Finished difference Result 11451 states and 40696 transitions. [2025-04-13 23:31:09,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:09,435 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:31:09,435 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:09,485 INFO L225 Difference]: With dead ends: 11451 [2025-04-13 23:31:09,485 INFO L226 Difference]: Without dead ends: 11383 [2025-04-13 23:31:09,489 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:31:09,489 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 331 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:09,489 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 118 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:31:09,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11383 states. [2025-04-13 23:31:09,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11383 to 6529. [2025-04-13 23:31:09,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6529 states, 6528 states have (on average 3.666360294117647) internal successors, (23934), 6528 states have internal predecessors, (23934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:09,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6529 states to 6529 states and 23934 transitions. [2025-04-13 23:31:09,653 INFO L79 Accepts]: Start accepts. Automaton has 6529 states and 23934 transitions. Word has length 54 [2025-04-13 23:31:09,653 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:09,653 INFO L485 AbstractCegarLoop]: Abstraction has 6529 states and 23934 transitions. [2025-04-13 23:31:09,653 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:09,653 INFO L278 IsEmpty]: Start isEmpty. Operand 6529 states and 23934 transitions. [2025-04-13 23:31:09,663 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:09,663 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:09,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:09,663 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable281 [2025-04-13 23:31:09,663 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 23:31:09,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:09,664 INFO L85 PathProgramCache]: Analyzing trace with hash -753324259, now seen corresponding path program 283 times [2025-04-13 23:31:09,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:09,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822681342] [2025-04-13 23:31:09,664 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:31:09,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:09,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:09,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:09,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:09,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:10,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 23:31:10,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:10,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822681342] [2025-04-13 23:31:10,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822681342] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:10,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:10,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:10,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853865207] [2025-04-13 23:31:10,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:10,256 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:10,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:10,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:10,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:10,256 INFO L87 Difference]: Start difference. First operand 6529 states and 23934 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:11,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:11,137 INFO L93 Difference]: Finished difference Result 13332 states and 47173 transitions. [2025-04-13 23:31:11,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:11,137 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:31:11,138 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:11,200 INFO L225 Difference]: With dead ends: 13332 [2025-04-13 23:31:11,201 INFO L226 Difference]: Without dead ends: 13264 [2025-04-13 23:31:11,206 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 23:31:11,206 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 358 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:11,206 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 99 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:31:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13264 states. [2025-04-13 23:31:11,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13264 to 6539. [2025-04-13 23:31:11,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6539 states, 6538 states have (on average 3.664576323034567) internal successors, (23959), 6538 states have internal predecessors, (23959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6539 states to 6539 states and 23959 transitions. [2025-04-13 23:31:11,432 INFO L79 Accepts]: Start accepts. Automaton has 6539 states and 23959 transitions. Word has length 54 [2025-04-13 23:31:11,432 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:11,432 INFO L485 AbstractCegarLoop]: Abstraction has 6539 states and 23959 transitions. [2025-04-13 23:31:11,432 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:11,432 INFO L278 IsEmpty]: Start isEmpty. Operand 6539 states and 23959 transitions. [2025-04-13 23:31:11,444 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:11,444 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:11,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:11,444 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable282 [2025-04-13 23:31:11,444 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 23:31:11,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:11,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1380437539, now seen corresponding path program 284 times [2025-04-13 23:31:11,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:11,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021852434] [2025-04-13 23:31:11,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:31:11,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:11,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:11,458 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:11,459 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:31:11,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:12,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 23:31:12,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:12,105 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021852434] [2025-04-13 23:31:12,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021852434] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:12,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:12,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:12,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455921032] [2025-04-13 23:31:12,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:12,105 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:12,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:12,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:12,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:12,106 INFO L87 Difference]: Start difference. First operand 6539 states and 23959 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:13,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:13,131 INFO L93 Difference]: Finished difference Result 11464 states and 40718 transitions. [2025-04-13 23:31:13,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:13,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 23:31:13,131 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:13,193 INFO L225 Difference]: With dead ends: 11464 [2025-04-13 23:31:13,193 INFO L226 Difference]: Without dead ends: 11383 [2025-04-13 23:31:13,199 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:31:13,199 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 324 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:13,199 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 121 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:31:13,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11383 states. [2025-04-13 23:31:13,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11383 to 6529. [2025-04-13 23:31:13,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6529 states, 6528 states have (on average 3.664828431372549) internal successors, (23924), 6528 states have internal predecessors, (23924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6529 states to 6529 states and 23924 transitions. [2025-04-13 23:31:13,377 INFO L79 Accepts]: Start accepts. Automaton has 6529 states and 23924 transitions. Word has length 54 [2025-04-13 23:31:13,378 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:13,378 INFO L485 AbstractCegarLoop]: Abstraction has 6529 states and 23924 transitions. [2025-04-13 23:31:13,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 23:31:13,378 INFO L278 IsEmpty]: Start isEmpty. Operand 6529 states and 23924 transitions. [2025-04-13 23:31:13,389 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:13,390 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:13,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:13,390 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable283 [2025-04-13 23:31:13,390 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 23:31:13,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:13,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1523802241, now seen corresponding path program 285 times [2025-04-13 23:31:13,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:13,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965904723] [2025-04-13 23:31:13,390 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:31:13,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:13,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:13,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:13,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:31:13,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:14,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 23:31:14,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:14,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965904723] [2025-04-13 23:31:14,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965904723] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:14,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:14,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:14,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627610163] [2025-04-13 23:31:14,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:14,006 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:14,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:14,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:14,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:14,006 INFO L87 Difference]: Start difference. First operand 6529 states and 23924 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:15,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:15,096 INFO L93 Difference]: Finished difference Result 13276 states and 47020 transitions. [2025-04-13 23:31:15,096 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:15,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 23:31:15,097 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:15,166 INFO L225 Difference]: With dead ends: 13276 [2025-04-13 23:31:15,166 INFO L226 Difference]: Without dead ends: 13191 [2025-04-13 23:31:15,173 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:31:15,173 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 306 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:15,173 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 132 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:31:15,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13191 states. [2025-04-13 23:31:15,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13191 to 6514. [2025-04-13 23:31:15,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6514 states, 6513 states have (on average 3.667127283893751) internal successors, (23884), 6513 states have internal predecessors, (23884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6514 states to 6514 states and 23884 transitions. [2025-04-13 23:31:15,360 INFO L79 Accepts]: Start accepts. Automaton has 6514 states and 23884 transitions. Word has length 54 [2025-04-13 23:31:15,360 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:15,360 INFO L485 AbstractCegarLoop]: Abstraction has 6514 states and 23884 transitions. [2025-04-13 23:31:15,360 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:15,360 INFO L278 IsEmpty]: Start isEmpty. Operand 6514 states and 23884 transitions. [2025-04-13 23:31:15,371 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:15,372 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:15,372 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:15,372 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable284 [2025-04-13 23:31:15,372 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 23:31:15,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:15,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1200165339, now seen corresponding path program 286 times [2025-04-13 23:31:15,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:15,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663052761] [2025-04-13 23:31:15,372 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:31:15,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:15,375 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:31:15,387 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 23:31:15,387 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:31:15,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:16,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:16,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663052761] [2025-04-13 23:31:16,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663052761] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:16,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:16,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:16,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123786930] [2025-04-13 23:31:16,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:16,003 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:16,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:16,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:16,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:16,003 INFO L87 Difference]: Start difference. First operand 6514 states and 23884 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:17,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:17,084 INFO L93 Difference]: Finished difference Result 11485 states and 40777 transitions. [2025-04-13 23:31:17,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:17,085 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:31:17,085 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:17,143 INFO L225 Difference]: With dead ends: 11485 [2025-04-13 23:31:17,143 INFO L226 Difference]: Without dead ends: 11348 [2025-04-13 23:31:17,148 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:31:17,148 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 295 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1722 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:17,148 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 136 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1722 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:31:17,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11348 states. [2025-04-13 23:31:17,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11348 to 6494. [2025-04-13 23:31:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6494 states, 6493 states have (on average 3.6676420760819344) internal successors, (23814), 6493 states have internal predecessors, (23814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:17,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6494 states to 6494 states and 23814 transitions. [2025-04-13 23:31:17,348 INFO L79 Accepts]: Start accepts. Automaton has 6494 states and 23814 transitions. Word has length 54 [2025-04-13 23:31:17,348 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:17,348 INFO L485 AbstractCegarLoop]: Abstraction has 6494 states and 23814 transitions. [2025-04-13 23:31:17,348 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:17,348 INFO L278 IsEmpty]: Start isEmpty. Operand 6494 states and 23814 transitions. [2025-04-13 23:31:17,359 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:17,359 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:17,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:17,359 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable285 [2025-04-13 23:31:17,359 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 23:31:17,360 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:17,360 INFO L85 PathProgramCache]: Analyzing trace with hash -917086943, now seen corresponding path program 287 times [2025-04-13 23:31:17,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:17,360 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219321622] [2025-04-13 23:31:17,360 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:31:17,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:17,363 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:17,374 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:17,374 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:31:17,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:17,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:17,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:17,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219321622] [2025-04-13 23:31:17,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219321622] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:17,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:17,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:17,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222611499] [2025-04-13 23:31:17,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:17,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:17,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:17,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:17,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:17,994 INFO L87 Difference]: Start difference. First operand 6494 states and 23814 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:18,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:18,961 INFO L93 Difference]: Finished difference Result 13381 states and 47302 transitions. [2025-04-13 23:31:18,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:18,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 23:31:18,962 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:19,021 INFO L225 Difference]: With dead ends: 13381 [2025-04-13 23:31:19,022 INFO L226 Difference]: Without dead ends: 13264 [2025-04-13 23:31:19,027 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:31:19,027 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 321 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:19,027 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 118 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:31:19,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13264 states. [2025-04-13 23:31:19,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13264 to 6516. [2025-04-13 23:31:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6516 states, 6515 states have (on average 3.6635456638526476) internal successors, (23868), 6515 states have internal predecessors, (23868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:19,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6516 states to 6516 states and 23868 transitions. [2025-04-13 23:31:19,219 INFO L79 Accepts]: Start accepts. Automaton has 6516 states and 23868 transitions. Word has length 54 [2025-04-13 23:31:19,219 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:19,219 INFO L485 AbstractCegarLoop]: Abstraction has 6516 states and 23868 transitions. [2025-04-13 23:31:19,219 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:19,219 INFO L278 IsEmpty]: Start isEmpty. Operand 6516 states and 23868 transitions. [2025-04-13 23:31:19,230 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:19,230 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:19,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:19,230 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable286 [2025-04-13 23:31:19,230 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 23:31:19,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:19,231 INFO L85 PathProgramCache]: Analyzing trace with hash 643022885, now seen corresponding path program 288 times [2025-04-13 23:31:19,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:19,231 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136172675] [2025-04-13 23:31:19,231 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:31:19,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:19,233 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:19,244 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:19,244 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:31:19,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:19,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:19,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:19,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136172675] [2025-04-13 23:31:19,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136172675] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:19,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:19,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:19,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753330172] [2025-04-13 23:31:19,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:19,910 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:19,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:19,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:19,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:19,910 INFO L87 Difference]: Start difference. First operand 6516 states and 23868 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:20,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:20,924 INFO L93 Difference]: Finished difference Result 11534 states and 40891 transitions. [2025-04-13 23:31:20,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:20,924 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:31:20,924 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:20,972 INFO L225 Difference]: With dead ends: 11534 [2025-04-13 23:31:20,973 INFO L226 Difference]: Without dead ends: 11466 [2025-04-13 23:31:20,977 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:31:20,977 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 316 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 1569 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:20,977 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 119 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1569 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:31:20,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11466 states. [2025-04-13 23:31:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11466 to 6531. [2025-04-13 23:31:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6531 states, 6530 states have (on average 3.662021439509954) internal successors, (23913), 6530 states have internal predecessors, (23913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:21,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6531 states to 6531 states and 23913 transitions. [2025-04-13 23:31:21,137 INFO L79 Accepts]: Start accepts. Automaton has 6531 states and 23913 transitions. Word has length 54 [2025-04-13 23:31:21,137 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:21,137 INFO L485 AbstractCegarLoop]: Abstraction has 6531 states and 23913 transitions. [2025-04-13 23:31:21,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 23:31:21,138 INFO L278 IsEmpty]: Start isEmpty. Operand 6531 states and 23913 transitions. [2025-04-13 23:31:21,148 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:21,148 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:21,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 23:31:21,148 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable287 [2025-04-13 23:31:21,148 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 23:31:21,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:21,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1942812863, now seen corresponding path program 289 times [2025-04-13 23:31:21,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:21,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057609333] [2025-04-13 23:31:21,149 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:31:21,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:21,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:21,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:21,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:21,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:21,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:21,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:21,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057609333] [2025-04-13 23:31:21,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057609333] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:21,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:21,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:21,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920663943] [2025-04-13 23:31:21,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:21,831 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:21,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:21,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:21,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:21,831 INFO L87 Difference]: Start difference. First operand 6531 states and 23913 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:22,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:22,844 INFO L93 Difference]: Finished difference Result 13360 states and 47227 transitions. [2025-04-13 23:31:22,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:22,844 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:31:22,845 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:22,904 INFO L225 Difference]: With dead ends: 13360 [2025-04-13 23:31:22,904 INFO L226 Difference]: Without dead ends: 13289 [2025-04-13 23:31:22,909 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:31:22,909 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 332 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:22,909 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 123 Invalid, 1657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:31:22,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13289 states. [2025-04-13 23:31:23,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13289 to 6542. [2025-04-13 23:31:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6542 states, 6541 states have (on average 3.6599908270906587) internal successors, (23940), 6541 states have internal predecessors, (23940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:23,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 23940 transitions. [2025-04-13 23:31:23,096 INFO L79 Accepts]: Start accepts. Automaton has 6542 states and 23940 transitions. Word has length 54 [2025-04-13 23:31:23,096 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:23,096 INFO L485 AbstractCegarLoop]: Abstraction has 6542 states and 23940 transitions. [2025-04-13 23:31:23,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 23:31:23,096 INFO L278 IsEmpty]: Start isEmpty. Operand 6542 states and 23940 transitions. [2025-04-13 23:31:23,107 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:23,107 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:23,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 23:31:23,107 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable288 [2025-04-13 23:31:23,108 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 23:31:23,108 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:23,108 INFO L85 PathProgramCache]: Analyzing trace with hash -156981691, now seen corresponding path program 290 times [2025-04-13 23:31:23,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:23,108 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969608496] [2025-04-13 23:31:23,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:31:23,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:23,111 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:23,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:23,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:31:23,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:23,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:23,743 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969608496] [2025-04-13 23:31:23,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969608496] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:23,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:23,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:23,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724392919] [2025-04-13 23:31:23,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:23,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:23,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:23,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:23,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:23,744 INFO L87 Difference]: Start difference. First operand 6542 states and 23940 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:24,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:24,806 INFO L93 Difference]: Finished difference Result 11548 states and 40915 transitions. [2025-04-13 23:31:24,806 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:24,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 23:31:24,806 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:24,857 INFO L225 Difference]: With dead ends: 11548 [2025-04-13 23:31:24,857 INFO L226 Difference]: Without dead ends: 11467 [2025-04-13 23:31:24,861 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:31:24,861 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 310 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:24,861 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 135 Invalid, 1737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1715 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:31:24,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11467 states. [2025-04-13 23:31:24,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11467 to 6532. [2025-04-13 23:31:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6532 states, 6531 states have (on average 3.6610013780431787) internal successors, (23910), 6531 states have internal predecessors, (23910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:24,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 23910 transitions. [2025-04-13 23:31:25,033 INFO L79 Accepts]: Start accepts. Automaton has 6532 states and 23910 transitions. Word has length 54 [2025-04-13 23:31:25,034 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:25,034 INFO L485 AbstractCegarLoop]: Abstraction has 6532 states and 23910 transitions. [2025-04-13 23:31:25,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 23:31:25,034 INFO L278 IsEmpty]: Start isEmpty. Operand 6532 states and 23910 transitions. [2025-04-13 23:31:25,044 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:25,045 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:25,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 23:31:25,045 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable289 [2025-04-13 23:31:25,045 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 23:31:25,045 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:25,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1002677537, now seen corresponding path program 291 times [2025-04-13 23:31:25,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:25,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011720233] [2025-04-13 23:31:25,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:31:25,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:25,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:25,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:25,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:31:25,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:25,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:25,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011720233] [2025-04-13 23:31:25,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011720233] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:25,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:25,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:25,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034037663] [2025-04-13 23:31:25,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:25,696 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:25,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:25,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:25,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:25,696 INFO L87 Difference]: Start difference. First operand 6532 states and 23910 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:26,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:26,809 INFO L93 Difference]: Finished difference Result 13279 states and 47006 transitions. [2025-04-13 23:31:26,810 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:26,810 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:31:26,810 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:26,865 INFO L225 Difference]: With dead ends: 13279 [2025-04-13 23:31:26,866 INFO L226 Difference]: Without dead ends: 13166 [2025-04-13 23:31:26,868 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:31:26,869 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 297 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:26,869 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 132 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1703 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:31:26,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13166 states. [2025-04-13 23:31:26,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13166 to 6489. [2025-04-13 23:31:26,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6489 states, 6488 states have (on average 3.667385943279901) internal successors, (23794), 6488 states have internal predecessors, (23794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:27,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6489 states to 6489 states and 23794 transitions. [2025-04-13 23:31:27,043 INFO L79 Accepts]: Start accepts. Automaton has 6489 states and 23794 transitions. Word has length 54 [2025-04-13 23:31:27,043 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:27,043 INFO L485 AbstractCegarLoop]: Abstraction has 6489 states and 23794 transitions. [2025-04-13 23:31:27,043 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:27,043 INFO L278 IsEmpty]: Start isEmpty. Operand 6489 states and 23794 transitions. [2025-04-13 23:31:27,054 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:27,054 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:27,054 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:27,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable290 [2025-04-13 23:31:27,054 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 23:31:27,054 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:27,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1563598851, now seen corresponding path program 292 times [2025-04-13 23:31:27,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:27,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732555194] [2025-04-13 23:31:27,054 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:31:27,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:27,057 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:31:27,069 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 23:31:27,069 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:31:27,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:27,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 23:31:27,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:27,685 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732555194] [2025-04-13 23:31:27,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732555194] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:27,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:27,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:27,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292459229] [2025-04-13 23:31:27,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:27,685 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:27,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:27,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:27,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:27,685 INFO L87 Difference]: Start difference. First operand 6489 states and 23794 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:28,731 INFO L93 Difference]: Finished difference Result 11401 states and 40522 transitions. [2025-04-13 23:31:28,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:28,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 23:31:28,732 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:28,790 INFO L225 Difference]: With dead ends: 11401 [2025-04-13 23:31:28,790 INFO L226 Difference]: Without dead ends: 11333 [2025-04-13 23:31:28,794 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:31:28,794 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 300 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:28,795 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 110 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:31:28,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11333 states. [2025-04-13 23:31:28,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11333 to 6499. [2025-04-13 23:31:28,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6499 states, 6498 states have (on average 3.6655894121268084) internal successors, (23819), 6498 states have internal predecessors, (23819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6499 states to 6499 states and 23819 transitions. [2025-04-13 23:31:28,979 INFO L79 Accepts]: Start accepts. Automaton has 6499 states and 23819 transitions. Word has length 54 [2025-04-13 23:31:28,979 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:28,979 INFO L485 AbstractCegarLoop]: Abstraction has 6499 states and 23819 transitions. [2025-04-13 23:31:28,979 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:28,979 INFO L278 IsEmpty]: Start isEmpty. Operand 6499 states and 23819 transitions. [2025-04-13 23:31:28,990 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:28,990 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:28,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 23:31:28,990 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable291 [2025-04-13 23:31:28,991 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 23:31:28,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:28,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1387033149, now seen corresponding path program 293 times [2025-04-13 23:31:28,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:28,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7867326] [2025-04-13 23:31:28,991 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:31:28,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:28,994 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:29,005 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:29,005 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:31:29,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:29,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 23:31:29,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:29,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7867326] [2025-04-13 23:31:29,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7867326] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:29,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:29,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:29,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274271618] [2025-04-13 23:31:29,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:29,606 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:29,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:29,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:29,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:29,606 INFO L87 Difference]: Start difference. First operand 6499 states and 23819 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:30,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:30,535 INFO L93 Difference]: Finished difference Result 13359 states and 47230 transitions. [2025-04-13 23:31:30,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:30,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 23:31:30,536 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:30,590 INFO L225 Difference]: With dead ends: 13359 [2025-04-13 23:31:30,590 INFO L226 Difference]: Without dead ends: 13288 [2025-04-13 23:31:30,595 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:31:30,595 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 353 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:30,595 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 104 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:31:30,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13288 states. [2025-04-13 23:31:30,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13288 to 6524. [2025-04-13 23:31:30,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6524 states, 6523 states have (on average 3.66457151617354) internal successors, (23904), 6523 states have internal predecessors, (23904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6524 states to 6524 states and 23904 transitions. [2025-04-13 23:31:30,765 INFO L79 Accepts]: Start accepts. Automaton has 6524 states and 23904 transitions. Word has length 54 [2025-04-13 23:31:30,765 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:30,765 INFO L485 AbstractCegarLoop]: Abstraction has 6524 states and 23904 transitions. [2025-04-13 23:31:30,765 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:30,765 INFO L278 IsEmpty]: Start isEmpty. Operand 6524 states and 23904 transitions. [2025-04-13 23:31:30,776 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:30,776 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:30,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:30,776 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable292 [2025-04-13 23:31:30,776 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 23:31:30,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:30,776 INFO L85 PathProgramCache]: Analyzing trace with hash 793120869, now seen corresponding path program 294 times [2025-04-13 23:31:30,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:30,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861190398] [2025-04-13 23:31:30,777 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:31:30,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:30,779 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:30,790 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:30,790 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:31:30,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:31,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:31,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:31,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861190398] [2025-04-13 23:31:31,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861190398] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:31,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:31,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:31,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081983737] [2025-04-13 23:31:31,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:31,407 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:31,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:31,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:31,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:31,407 INFO L87 Difference]: Start difference. First operand 6524 states and 23904 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:32,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:32,374 INFO L93 Difference]: Finished difference Result 11380 states and 40489 transitions. [2025-04-13 23:31:32,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:32,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 23:31:32,374 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:32,425 INFO L225 Difference]: With dead ends: 11380 [2025-04-13 23:31:32,426 INFO L226 Difference]: Without dead ends: 11300 [2025-04-13 23:31:32,429 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:31:32,430 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 295 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:32,430 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 109 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:31:32,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11300 states. [2025-04-13 23:31:32,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11300 to 6514. [2025-04-13 23:31:32,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6514 states, 6513 states have (on average 3.6655918931368032) internal successors, (23874), 6513 states have internal predecessors, (23874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6514 states to 6514 states and 23874 transitions. [2025-04-13 23:31:32,602 INFO L79 Accepts]: Start accepts. Automaton has 6514 states and 23874 transitions. Word has length 54 [2025-04-13 23:31:32,602 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:32,602 INFO L485 AbstractCegarLoop]: Abstraction has 6514 states and 23874 transitions. [2025-04-13 23:31:32,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 23:31:32,602 INFO L278 IsEmpty]: Start isEmpty. Operand 6514 states and 23874 transitions. [2025-04-13 23:31:32,613 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:32,613 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:32,613 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:32,613 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable293 [2025-04-13 23:31:32,613 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 23:31:32,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:32,614 INFO L85 PathProgramCache]: Analyzing trace with hash -2107929571, now seen corresponding path program 295 times [2025-04-13 23:31:32,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:32,614 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106799425] [2025-04-13 23:31:32,614 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:31:32,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:32,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:32,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:32,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:32,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:33,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 23:31:33,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:33,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106799425] [2025-04-13 23:31:33,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106799425] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:33,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:33,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:33,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807799030] [2025-04-13 23:31:33,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:33,200 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:33,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:33,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:33,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:33,201 INFO L87 Difference]: Start difference. First operand 6514 states and 23874 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:34,191 INFO L93 Difference]: Finished difference Result 13346 states and 47183 transitions. [2025-04-13 23:31:34,192 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:34,192 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:31:34,192 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:34,250 INFO L225 Difference]: With dead ends: 13346 [2025-04-13 23:31:34,251 INFO L226 Difference]: Without dead ends: 13268 [2025-04-13 23:31:34,256 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 23:31:34,256 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 301 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1699 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:34,256 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 130 Invalid, 1721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1699 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:31:34,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13268 states. [2025-04-13 23:31:34,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13268 to 6504. [2025-04-13 23:31:34,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6504 states, 6503 states have (on average 3.666615408273105) internal successors, (23844), 6503 states have internal predecessors, (23844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6504 states to 6504 states and 23844 transitions. [2025-04-13 23:31:34,435 INFO L79 Accepts]: Start accepts. Automaton has 6504 states and 23844 transitions. Word has length 54 [2025-04-13 23:31:34,436 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:34,436 INFO L485 AbstractCegarLoop]: Abstraction has 6504 states and 23844 transitions. [2025-04-13 23:31:34,436 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:34,436 INFO L278 IsEmpty]: Start isEmpty. Operand 6504 states and 23844 transitions. [2025-04-13 23:31:34,446 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:34,447 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:34,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:34,447 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable294 [2025-04-13 23:31:34,447 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 23:31:34,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:34,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1728004643, now seen corresponding path program 296 times [2025-04-13 23:31:34,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:34,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473333034] [2025-04-13 23:31:34,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:31:34,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:34,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:34,461 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:34,461 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:31:34,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:35,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:35,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:35,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473333034] [2025-04-13 23:31:35,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473333034] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:35,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:35,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:35,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709698371] [2025-04-13 23:31:35,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:35,058 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:35,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:35,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:35,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:35,059 INFO L87 Difference]: Start difference. First operand 6504 states and 23844 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:36,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:36,053 INFO L93 Difference]: Finished difference Result 11442 states and 40647 transitions. [2025-04-13 23:31:36,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:36,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 23:31:36,053 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:36,109 INFO L225 Difference]: With dead ends: 11442 [2025-04-13 23:31:36,109 INFO L226 Difference]: Without dead ends: 11371 [2025-04-13 23:31:36,113 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:31:36,113 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 300 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 1576 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:36,113 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 119 Invalid, 1597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1576 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:31:36,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11371 states. [2025-04-13 23:31:36,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11371 to 6515. [2025-04-13 23:31:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6515 states, 6514 states have (on average 3.6645686214307647) internal successors, (23871), 6514 states have internal predecessors, (23871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:36,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6515 states to 6515 states and 23871 transitions. [2025-04-13 23:31:36,311 INFO L79 Accepts]: Start accepts. Automaton has 6515 states and 23871 transitions. Word has length 54 [2025-04-13 23:31:36,311 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:36,311 INFO L485 AbstractCegarLoop]: Abstraction has 6515 states and 23871 transitions. [2025-04-13 23:31:36,311 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:36,311 INFO L278 IsEmpty]: Start isEmpty. Operand 6515 states and 23871 transitions. [2025-04-13 23:31:36,321 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:36,322 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:36,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 23:31:36,322 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable295 [2025-04-13 23:31:36,322 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 23:31:36,322 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:36,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1022947813, now seen corresponding path program 297 times [2025-04-13 23:31:36,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:36,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355994459] [2025-04-13 23:31:36,323 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:31:36,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:36,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:36,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:36,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:31:36,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:36,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:36,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355994459] [2025-04-13 23:31:36,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355994459] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:36,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:36,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:36,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26841014] [2025-04-13 23:31:36,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:36,968 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:36,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:36,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:36,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:36,968 INFO L87 Difference]: Start difference. First operand 6515 states and 23871 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:37,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:37,933 INFO L93 Difference]: Finished difference Result 13431 states and 47403 transitions. [2025-04-13 23:31:37,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:37,934 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:31:37,934 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:38,005 INFO L225 Difference]: With dead ends: 13431 [2025-04-13 23:31:38,005 INFO L226 Difference]: Without dead ends: 13360 [2025-04-13 23:31:38,011 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 23:31:38,011 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 314 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:38,011 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 125 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:31:38,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13360 states. [2025-04-13 23:31:38,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13360 to 6515. [2025-04-13 23:31:38,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6515 states, 6514 states have (on average 3.6645686214307647) internal successors, (23871), 6514 states have internal predecessors, (23871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6515 states to 6515 states and 23871 transitions. [2025-04-13 23:31:38,201 INFO L79 Accepts]: Start accepts. Automaton has 6515 states and 23871 transitions. Word has length 54 [2025-04-13 23:31:38,202 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:38,202 INFO L485 AbstractCegarLoop]: Abstraction has 6515 states and 23871 transitions. [2025-04-13 23:31:38,202 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:38,202 INFO L278 IsEmpty]: Start isEmpty. Operand 6515 states and 23871 transitions. [2025-04-13 23:31:38,212 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:38,212 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:38,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 23:31:38,212 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable296 [2025-04-13 23:31:38,213 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 23:31:38,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:38,213 INFO L85 PathProgramCache]: Analyzing trace with hash 787869317, now seen corresponding path program 298 times [2025-04-13 23:31:38,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:38,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128603702] [2025-04-13 23:31:38,213 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:31:38,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:38,215 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:31:38,251 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 23:31:38,251 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:31:38,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:38,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:38,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:38,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128603702] [2025-04-13 23:31:38,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128603702] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:38,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:38,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:38,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388880656] [2025-04-13 23:31:38,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:38,860 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:38,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:38,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:38,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:38,860 INFO L87 Difference]: Start difference. First operand 6515 states and 23871 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:39,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:39,878 INFO L93 Difference]: Finished difference Result 11382 states and 40483 transitions. [2025-04-13 23:31:39,878 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:39,878 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:31:39,878 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:39,931 INFO L225 Difference]: With dead ends: 11382 [2025-04-13 23:31:39,931 INFO L226 Difference]: Without dead ends: 11296 [2025-04-13 23:31:39,935 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:31:39,935 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 280 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:39,935 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 128 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:31:39,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11296 states. [2025-04-13 23:31:40,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11296 to 6510. [2025-04-13 23:31:40,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6510 states, 6509 states have (on average 3.6650791212167766) internal successors, (23856), 6509 states have internal predecessors, (23856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6510 states to 6510 states and 23856 transitions. [2025-04-13 23:31:40,111 INFO L79 Accepts]: Start accepts. Automaton has 6510 states and 23856 transitions. Word has length 54 [2025-04-13 23:31:40,111 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:40,111 INFO L485 AbstractCegarLoop]: Abstraction has 6510 states and 23856 transitions. [2025-04-13 23:31:40,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 23:31:40,111 INFO L278 IsEmpty]: Start isEmpty. Operand 6510 states and 23856 transitions. [2025-04-13 23:31:40,122 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:40,122 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:40,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:40,123 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable297 [2025-04-13 23:31:40,123 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 23:31:40,123 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:40,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1963083139, now seen corresponding path program 299 times [2025-04-13 23:31:40,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:40,123 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962543190] [2025-04-13 23:31:40,123 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:31:40,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:40,126 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:40,137 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:40,137 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:31:40,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:40,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:40,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:40,759 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962543190] [2025-04-13 23:31:40,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962543190] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:40,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:40,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:40,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26472827] [2025-04-13 23:31:40,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:40,759 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:40,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:40,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:40,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:40,760 INFO L87 Difference]: Start difference. First operand 6510 states and 23856 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:41,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:41,759 INFO L93 Difference]: Finished difference Result 13366 states and 47235 transitions. [2025-04-13 23:31:41,760 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:41,760 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:31:41,760 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:41,821 INFO L225 Difference]: With dead ends: 13366 [2025-04-13 23:31:41,821 INFO L226 Difference]: Without dead ends: 13285 [2025-04-13 23:31:41,826 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:31:41,826 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 350 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1585 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:41,826 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 115 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1585 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:31:41,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13285 states. [2025-04-13 23:31:41,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13285 to 6499. [2025-04-13 23:31:41,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6499 states, 6498 states have (on average 3.6663588796552786) internal successors, (23824), 6498 states have internal predecessors, (23824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6499 states to 6499 states and 23824 transitions. [2025-04-13 23:31:42,012 INFO L79 Accepts]: Start accepts. Automaton has 6499 states and 23824 transitions. Word has length 54 [2025-04-13 23:31:42,012 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:42,012 INFO L485 AbstractCegarLoop]: Abstraction has 6499 states and 23824 transitions. [2025-04-13 23:31:42,012 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:42,012 INFO L278 IsEmpty]: Start isEmpty. Operand 6499 states and 23824 transitions. [2025-04-13 23:31:42,023 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:42,023 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:42,023 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:42,023 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable298 [2025-04-13 23:31:42,023 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 23:31:42,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:42,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1399836167, now seen corresponding path program 300 times [2025-04-13 23:31:42,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:42,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471075105] [2025-04-13 23:31:42,023 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:31:42,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:42,026 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:42,037 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:42,037 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:31:42,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:42,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:42,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:42,682 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471075105] [2025-04-13 23:31:42,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471075105] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:42,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:42,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:42,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910129084] [2025-04-13 23:31:42,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:42,682 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:42,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:42,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:42,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:42,682 INFO L87 Difference]: Start difference. First operand 6499 states and 23824 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:43,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:43,695 INFO L93 Difference]: Finished difference Result 11323 states and 40308 transitions. [2025-04-13 23:31:43,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:43,696 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:31:43,696 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:43,754 INFO L225 Difference]: With dead ends: 11323 [2025-04-13 23:31:43,755 INFO L226 Difference]: Without dead ends: 11206 [2025-04-13 23:31:43,761 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:31:43,761 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 291 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:43,761 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 111 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1512 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:31:43,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11206 states. [2025-04-13 23:31:43,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11206 to 6521. [2025-04-13 23:31:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6521 states, 6520 states have (on average 3.6622699386503066) internal successors, (23878), 6520 states have internal predecessors, (23878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:43,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6521 states to 6521 states and 23878 transitions. [2025-04-13 23:31:43,935 INFO L79 Accepts]: Start accepts. Automaton has 6521 states and 23878 transitions. Word has length 54 [2025-04-13 23:31:43,935 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:43,935 INFO L485 AbstractCegarLoop]: Abstraction has 6521 states and 23878 transitions. [2025-04-13 23:31:43,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 23:31:43,935 INFO L278 IsEmpty]: Start isEmpty. Operand 6521 states and 23878 transitions. [2025-04-13 23:31:43,946 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:43,946 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:43,946 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:43,947 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable299 [2025-04-13 23:31:43,947 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 23:31:43,947 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:43,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1187353605, now seen corresponding path program 301 times [2025-04-13 23:31:43,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:43,947 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755427311] [2025-04-13 23:31:43,947 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:31:43,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:43,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:43,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:43,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:43,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:44,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:44,541 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755427311] [2025-04-13 23:31:44,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755427311] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:44,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:44,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:44,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055859977] [2025-04-13 23:31:44,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:44,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:44,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:44,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:44,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:44,542 INFO L87 Difference]: Start difference. First operand 6521 states and 23878 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:45,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:45,470 INFO L93 Difference]: Finished difference Result 13433 states and 47400 transitions. [2025-04-13 23:31:45,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:45,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 23:31:45,471 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:45,528 INFO L225 Difference]: With dead ends: 13433 [2025-04-13 23:31:45,529 INFO L226 Difference]: Without dead ends: 13365 [2025-04-13 23:31:45,532 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:31:45,532 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 375 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:45,532 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 100 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:31:45,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13365 states. [2025-04-13 23:31:45,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13365 to 6531. [2025-04-13 23:31:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6531 states, 6530 states have (on average 3.660490045941807) internal successors, (23903), 6530 states have internal predecessors, (23903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6531 states to 6531 states and 23903 transitions. [2025-04-13 23:31:45,704 INFO L79 Accepts]: Start accepts. Automaton has 6531 states and 23903 transitions. Word has length 54 [2025-04-13 23:31:45,704 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:45,704 INFO L485 AbstractCegarLoop]: Abstraction has 6531 states and 23903 transitions. [2025-04-13 23:31:45,704 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:45,705 INFO L278 IsEmpty]: Start isEmpty. Operand 6531 states and 23903 transitions. [2025-04-13 23:31:45,715 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:45,715 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:45,715 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:45,715 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable300 [2025-04-13 23:31:45,716 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 23:31:45,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:45,716 INFO L85 PathProgramCache]: Analyzing trace with hash -35231323, now seen corresponding path program 302 times [2025-04-13 23:31:45,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:45,716 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757833391] [2025-04-13 23:31:45,716 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:31:45,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:45,718 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:45,729 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:45,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:31:45,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:46,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 23:31:46,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:46,339 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757833391] [2025-04-13 23:31:46,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757833391] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:46,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:46,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:46,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162352218] [2025-04-13 23:31:46,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:46,339 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:46,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:46,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:46,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:46,339 INFO L87 Difference]: Start difference. First operand 6531 states and 23903 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:47,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:47,349 INFO L93 Difference]: Finished difference Result 11297 states and 40213 transitions. [2025-04-13 23:31:47,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:47,349 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:31:47,349 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:47,408 INFO L225 Difference]: With dead ends: 11297 [2025-04-13 23:31:47,408 INFO L226 Difference]: Without dead ends: 11226 [2025-04-13 23:31:47,412 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:31:47,412 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 270 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:47,412 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 123 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:31:47,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11226 states. [2025-04-13 23:31:47,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11226 to 6542. [2025-04-13 23:31:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6542 states, 6541 states have (on average 3.658462008867146) internal successors, (23930), 6541 states have internal predecessors, (23930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:47,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 23930 transitions. [2025-04-13 23:31:47,581 INFO L79 Accepts]: Start accepts. Automaton has 6542 states and 23930 transitions. Word has length 54 [2025-04-13 23:31:47,582 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:47,582 INFO L485 AbstractCegarLoop]: Abstraction has 6542 states and 23930 transitions. [2025-04-13 23:31:47,582 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:47,582 INFO L278 IsEmpty]: Start isEmpty. Operand 6542 states and 23930 transitions. [2025-04-13 23:31:47,592 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:47,593 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:47,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:47,593 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable301 [2025-04-13 23:31:47,593 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 23:31:47,593 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:47,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1957831587, now seen corresponding path program 303 times [2025-04-13 23:31:47,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:47,593 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740912958] [2025-04-13 23:31:47,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:31:47,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:47,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:47,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:47,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:31:47,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:48,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:48,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:48,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740912958] [2025-04-13 23:31:48,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740912958] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:48,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:48,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:48,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209526519] [2025-04-13 23:31:48,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:48,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:48,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:48,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:48,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:48,219 INFO L87 Difference]: Start difference. First operand 6542 states and 23930 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:49,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:49,116 INFO L93 Difference]: Finished difference Result 13398 states and 47309 transitions. [2025-04-13 23:31:49,117 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:49,117 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:31:49,117 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:49,173 INFO L225 Difference]: With dead ends: 13398 [2025-04-13 23:31:49,174 INFO L226 Difference]: Without dead ends: 13313 [2025-04-13 23:31:49,179 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:31:49,179 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 338 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:49,179 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 104 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:31:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13313 states. [2025-04-13 23:31:49,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13313 to 6527. [2025-04-13 23:31:49,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6527 states, 6526 states have (on average 3.6607416487894575) internal successors, (23890), 6526 states have internal predecessors, (23890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6527 states to 6527 states and 23890 transitions. [2025-04-13 23:31:49,364 INFO L79 Accepts]: Start accepts. Automaton has 6527 states and 23890 transitions. Word has length 54 [2025-04-13 23:31:49,364 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:49,364 INFO L485 AbstractCegarLoop]: Abstraction has 6527 states and 23890 transitions. [2025-04-13 23:31:49,365 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:49,365 INFO L278 IsEmpty]: Start isEmpty. Operand 6527 states and 23890 transitions. [2025-04-13 23:31:49,375 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:49,375 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:49,375 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:49,376 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable302 [2025-04-13 23:31:49,376 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 23:31:49,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:49,376 INFO L85 PathProgramCache]: Analyzing trace with hash -975366649, now seen corresponding path program 304 times [2025-04-13 23:31:49,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:49,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922633036] [2025-04-13 23:31:49,376 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:31:49,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:49,379 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:31:49,389 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 23:31:49,390 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:31:49,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:50,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 23:31:50,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:50,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922633036] [2025-04-13 23:31:50,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922633036] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:50,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:50,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 23:31:50,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581728805] [2025-04-13 23:31:50,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:50,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:31:50,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:50,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:31:50,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:31:50,116 INFO L87 Difference]: Start difference. First operand 6527 states and 23890 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:51,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:51,337 INFO L93 Difference]: Finished difference Result 12833 states and 45195 transitions. [2025-04-13 23:31:51,337 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 23:31:51,337 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:31:51,337 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:51,395 INFO L225 Difference]: With dead ends: 12833 [2025-04-13 23:31:51,395 INFO L226 Difference]: Without dead ends: 12648 [2025-04-13 23:31:51,400 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=316, Invalid=676, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:31:51,400 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 385 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:51,400 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 124 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:31:51,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12648 states. [2025-04-13 23:31:51,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12648 to 6464. [2025-04-13 23:31:51,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6464 states, 6463 states have (on average 3.6691938728144824) internal successors, (23714), 6463 states have internal predecessors, (23714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6464 states to 6464 states and 23714 transitions. [2025-04-13 23:31:51,588 INFO L79 Accepts]: Start accepts. Automaton has 6464 states and 23714 transitions. Word has length 54 [2025-04-13 23:31:51,588 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:51,588 INFO L485 AbstractCegarLoop]: Abstraction has 6464 states and 23714 transitions. [2025-04-13 23:31:51,588 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:51,588 INFO L278 IsEmpty]: Start isEmpty. Operand 6464 states and 23714 transitions. [2025-04-13 23:31:51,599 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:51,599 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:51,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:51,599 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable303 [2025-04-13 23:31:51,599 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 23:31:51,599 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:51,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1590182573, now seen corresponding path program 305 times [2025-04-13 23:31:51,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:51,600 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673919518] [2025-04-13 23:31:51,600 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:31:51,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:51,603 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:51,613 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:51,613 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:31:51,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:52,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 23:31:52,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:52,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673919518] [2025-04-13 23:31:52,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673919518] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:52,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:52,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:52,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125905661] [2025-04-13 23:31:52,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:52,232 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:52,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:52,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:52,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:52,232 INFO L87 Difference]: Start difference. First operand 6464 states and 23714 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:53,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:53,101 INFO L93 Difference]: Finished difference Result 13364 states and 47234 transitions. [2025-04-13 23:31:53,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:53,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 23:31:53,102 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:53,158 INFO L225 Difference]: With dead ends: 13364 [2025-04-13 23:31:53,158 INFO L226 Difference]: Without dead ends: 13293 [2025-04-13 23:31:53,163 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:31:53,163 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 349 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:53,163 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 95 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:31:53,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13293 states. [2025-04-13 23:31:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13293 to 6497. [2025-04-13 23:31:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6497 states, 6496 states have (on average 3.6664100985221677) internal successors, (23817), 6496 states have internal predecessors, (23817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:53,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6497 states to 6497 states and 23817 transitions. [2025-04-13 23:31:53,334 INFO L79 Accepts]: Start accepts. Automaton has 6497 states and 23817 transitions. Word has length 54 [2025-04-13 23:31:53,334 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:53,334 INFO L485 AbstractCegarLoop]: Abstraction has 6497 states and 23817 transitions. [2025-04-13 23:31:53,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 23:31:53,334 INFO L278 IsEmpty]: Start isEmpty. Operand 6497 states and 23817 transitions. [2025-04-13 23:31:53,345 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:53,345 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:53,345 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:53,345 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable304 [2025-04-13 23:31:53,345 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 23:31:53,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:53,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1764709179, now seen corresponding path program 306 times [2025-04-13 23:31:53,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:53,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218504327] [2025-04-13 23:31:53,346 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:31:53,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:53,348 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:53,359 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:53,359 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:31:53,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:54,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:54,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218504327] [2025-04-13 23:31:54,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218504327] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:54,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:54,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:54,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645652947] [2025-04-13 23:31:54,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:54,052 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:54,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:54,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:54,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:54,052 INFO L87 Difference]: Start difference. First operand 6497 states and 23817 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:54,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:54,991 INFO L93 Difference]: Finished difference Result 11432 states and 40632 transitions. [2025-04-13 23:31:54,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:54,991 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:31:54,991 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:55,044 INFO L225 Difference]: With dead ends: 11432 [2025-04-13 23:31:55,044 INFO L226 Difference]: Without dead ends: 11364 [2025-04-13 23:31:55,048 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:31:55,048 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 274 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:55,048 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 134 Invalid, 1754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:31:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11364 states. [2025-04-13 23:31:55,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11364 to 6557. [2025-04-13 23:31:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6557 states, 6556 states have (on average 3.6656497864551554) internal successors, (24032), 6556 states have internal predecessors, (24032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:55,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6557 states to 6557 states and 24032 transitions. [2025-04-13 23:31:55,221 INFO L79 Accepts]: Start accepts. Automaton has 6557 states and 24032 transitions. Word has length 54 [2025-04-13 23:31:55,221 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:55,221 INFO L485 AbstractCegarLoop]: Abstraction has 6557 states and 24032 transitions. [2025-04-13 23:31:55,221 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:55,222 INFO L278 IsEmpty]: Start isEmpty. Operand 6557 states and 24032 transitions. [2025-04-13 23:31:55,232 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:55,232 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:55,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 23:31:55,233 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable305 [2025-04-13 23:31:55,233 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 23:31:55,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:55,233 INFO L85 PathProgramCache]: Analyzing trace with hash 650047247, now seen corresponding path program 307 times [2025-04-13 23:31:55,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:55,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013058719] [2025-04-13 23:31:55,233 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:31:55,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:55,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:55,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:55,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:55,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:55,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 23:31:55,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:55,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013058719] [2025-04-13 23:31:55,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013058719] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:55,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:55,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:55,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676491447] [2025-04-13 23:31:55,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:55,854 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:55,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:55,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:55,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:55,854 INFO L87 Difference]: Start difference. First operand 6557 states and 24032 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:56,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:56,764 INFO L93 Difference]: Finished difference Result 13423 states and 47436 transitions. [2025-04-13 23:31:56,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:56,764 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:31:56,764 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:56,829 INFO L225 Difference]: With dead ends: 13423 [2025-04-13 23:31:56,829 INFO L226 Difference]: Without dead ends: 13342 [2025-04-13 23:31:56,834 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:31:56,835 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 309 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:56,835 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 104 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:31:56,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13342 states. [2025-04-13 23:31:57,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13342 to 6546. [2025-04-13 23:31:57,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6546 states, 6545 states have (on average 3.6660045836516426) internal successors, (23994), 6545 states have internal predecessors, (23994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:57,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6546 states to 6546 states and 23994 transitions. [2025-04-13 23:31:57,049 INFO L79 Accepts]: Start accepts. Automaton has 6546 states and 23994 transitions. Word has length 54 [2025-04-13 23:31:57,049 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:57,049 INFO L485 AbstractCegarLoop]: Abstraction has 6546 states and 23994 transitions. [2025-04-13 23:31:57,050 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:57,050 INFO L278 IsEmpty]: Start isEmpty. Operand 6546 states and 23994 transitions. [2025-04-13 23:31:57,060 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:57,061 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:57,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 23:31:57,061 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable306 [2025-04-13 23:31:57,061 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 23:31:57,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:57,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1730253541, now seen corresponding path program 308 times [2025-04-13 23:31:57,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:57,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97961072] [2025-04-13 23:31:57,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:31:57,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:57,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:57,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:57,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:31:57,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:57,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:57,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:57,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97961072] [2025-04-13 23:31:57,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97961072] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:57,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:57,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:57,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159014434] [2025-04-13 23:31:57,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:57,724 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:57,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:57,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:57,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:57,724 INFO L87 Difference]: Start difference. First operand 6546 states and 23994 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:58,620 INFO L93 Difference]: Finished difference Result 11353 states and 40411 transitions. [2025-04-13 23:31:58,620 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:31:58,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 23:31:58,620 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:58,677 INFO L225 Difference]: With dead ends: 11353 [2025-04-13 23:31:58,677 INFO L226 Difference]: Without dead ends: 11272 [2025-04-13 23:31:58,682 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 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 23:31:58,682 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 286 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:58,682 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 108 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1511 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:31:58,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11272 states. [2025-04-13 23:31:58,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11272 to 6536. [2025-04-13 23:31:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6536 states, 6535 states have (on average 3.6662586074980874) internal successors, (23959), 6535 states have internal predecessors, (23959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:58,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 23959 transitions. [2025-04-13 23:31:58,857 INFO L79 Accepts]: Start accepts. Automaton has 6536 states and 23959 transitions. Word has length 54 [2025-04-13 23:31:58,857 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:58,857 INFO L485 AbstractCegarLoop]: Abstraction has 6536 states and 23959 transitions. [2025-04-13 23:31:58,857 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:31:58,857 INFO L278 IsEmpty]: Start isEmpty. Operand 6536 states and 23959 transitions. [2025-04-13 23:31:58,868 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:58,868 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:58,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 23:31:58,868 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable307 [2025-04-13 23:31:58,868 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 23:31:58,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:58,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2031353315, now seen corresponding path program 309 times [2025-04-13 23:31:58,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:58,869 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63157236] [2025-04-13 23:31:58,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:31:58,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:58,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:31:58,882 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:58,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:31:58,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:59,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:59,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63157236] [2025-04-13 23:31:59,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63157236] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:59,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:59,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:31:59,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068331057] [2025-04-13 23:31:59,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:59,520 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:31:59,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:59,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:31:59,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:31:59,520 INFO L87 Difference]: Start difference. First operand 6536 states and 23959 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:00,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:00,459 INFO L93 Difference]: Finished difference Result 13376 states and 47315 transitions. [2025-04-13 23:32:00,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:00,459 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:00,459 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:00,519 INFO L225 Difference]: With dead ends: 13376 [2025-04-13 23:32:00,519 INFO L226 Difference]: Without dead ends: 13240 [2025-04-13 23:32:00,524 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:32:00,525 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 315 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:00,525 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 107 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:32:00,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13240 states. [2025-04-13 23:32:00,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13240 to 6514. [2025-04-13 23:32:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6514 states, 6513 states have (on average 3.667127283893751) internal successors, (23884), 6513 states have internal predecessors, (23884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:00,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6514 states to 6514 states and 23884 transitions. [2025-04-13 23:32:00,711 INFO L79 Accepts]: Start accepts. Automaton has 6514 states and 23884 transitions. Word has length 54 [2025-04-13 23:32:00,711 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:00,711 INFO L485 AbstractCegarLoop]: Abstraction has 6514 states and 23884 transitions. [2025-04-13 23:32:00,712 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:00,712 INFO L278 IsEmpty]: Start isEmpty. Operand 6514 states and 23884 transitions. [2025-04-13 23:32:00,722 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:00,723 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:00,723 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:00,723 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable308 [2025-04-13 23:32:00,723 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 23:32:00,723 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:00,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1989668601, now seen corresponding path program 310 times [2025-04-13 23:32:00,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:00,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950970301] [2025-04-13 23:32:00,723 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:32:00,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:00,726 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:32:00,737 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 23:32:00,737 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:32:00,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:01,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 23:32:01,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:01,336 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950970301] [2025-04-13 23:32:01,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950970301] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:01,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:01,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 23:32:01,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213614728] [2025-04-13 23:32:01,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:01,337 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:32:01,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:01,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:32:01,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:32:01,337 INFO L87 Difference]: Start difference. First operand 6514 states and 23884 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:02,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:02,435 INFO L93 Difference]: Finished difference Result 12928 states and 45478 transitions. [2025-04-13 23:32:02,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:32:02,436 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:02,436 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:02,492 INFO L225 Difference]: With dead ends: 12928 [2025-04-13 23:32:02,493 INFO L226 Difference]: Without dead ends: 12800 [2025-04-13 23:32:02,498 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=553, Unknown=0, NotChecked=0, Total=812 [2025-04-13 23:32:02,498 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 345 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:02,498 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 135 Invalid, 1832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1798 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:32:02,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12800 states. [2025-04-13 23:32:02,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12800 to 6494. [2025-04-13 23:32:02,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6494 states, 6493 states have (on average 3.6676420760819344) internal successors, (23814), 6493 states have internal predecessors, (23814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:02,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6494 states to 6494 states and 23814 transitions. [2025-04-13 23:32:02,677 INFO L79 Accepts]: Start accepts. Automaton has 6494 states and 23814 transitions. Word has length 54 [2025-04-13 23:32:02,678 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:02,678 INFO L485 AbstractCegarLoop]: Abstraction has 6494 states and 23814 transitions. [2025-04-13 23:32:02,678 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:02,678 INFO L278 IsEmpty]: Start isEmpty. Operand 6494 states and 23814 transitions. [2025-04-13 23:32:02,689 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:02,689 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:02,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:02,689 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable309 [2025-04-13 23:32:02,689 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 23:32:02,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:02,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1588574893, now seen corresponding path program 311 times [2025-04-13 23:32:02,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:02,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722848601] [2025-04-13 23:32:02,689 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:32:02,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:02,692 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:02,703 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:02,703 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:32:02,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:03,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:03,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:03,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722848601] [2025-04-13 23:32:03,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722848601] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:03,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:03,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:03,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921359147] [2025-04-13 23:32:03,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:03,262 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:03,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:03,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:03,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:03,263 INFO L87 Difference]: Start difference. First operand 6494 states and 23814 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:04,168 INFO L93 Difference]: Finished difference Result 13224 states and 46845 transitions. [2025-04-13 23:32:04,168 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:04,168 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:04,168 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:04,227 INFO L225 Difference]: With dead ends: 13224 [2025-04-13 23:32:04,227 INFO L226 Difference]: Without dead ends: 13156 [2025-04-13 23:32:04,232 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:32:04,232 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 333 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:04,232 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 108 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:32:04,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13156 states. [2025-04-13 23:32:04,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13156 to 6524. [2025-04-13 23:32:04,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6524 states, 6523 states have (on average 3.665338034646635) internal successors, (23909), 6523 states have internal predecessors, (23909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6524 states to 6524 states and 23909 transitions. [2025-04-13 23:32:04,411 INFO L79 Accepts]: Start accepts. Automaton has 6524 states and 23909 transitions. Word has length 54 [2025-04-13 23:32:04,412 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:04,412 INFO L485 AbstractCegarLoop]: Abstraction has 6524 states and 23909 transitions. [2025-04-13 23:32:04,412 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:04,412 INFO L278 IsEmpty]: Start isEmpty. Operand 6524 states and 23909 transitions. [2025-04-13 23:32:04,422 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:04,423 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:04,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 23:32:04,423 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable310 [2025-04-13 23:32:04,423 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 23:32:04,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:04,423 INFO L85 PathProgramCache]: Analyzing trace with hash 824789223, now seen corresponding path program 312 times [2025-04-13 23:32:04,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:04,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523145926] [2025-04-13 23:32:04,423 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:32:04,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:04,426 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:04,436 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:04,436 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:32:04,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:05,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:05,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:05,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523145926] [2025-04-13 23:32:05,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523145926] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:05,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:05,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:05,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423441463] [2025-04-13 23:32:05,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:05,089 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:05,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:05,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:05,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:05,089 INFO L87 Difference]: Start difference. First operand 6524 states and 23909 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:05,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:05,941 INFO L93 Difference]: Finished difference Result 11525 states and 40865 transitions. [2025-04-13 23:32:05,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:05,941 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:05,942 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:05,997 INFO L225 Difference]: With dead ends: 11525 [2025-04-13 23:32:05,997 INFO L226 Difference]: Without dead ends: 11457 [2025-04-13 23:32:06,001 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:32:06,002 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 323 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:06,002 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 105 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:32:06,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11457 states. [2025-04-13 23:32:06,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11457 to 6539. [2025-04-13 23:32:06,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6539 states, 6538 states have (on average 3.663811563169165) internal successors, (23954), 6538 states have internal predecessors, (23954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:06,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6539 states to 6539 states and 23954 transitions. [2025-04-13 23:32:06,212 INFO L79 Accepts]: Start accepts. Automaton has 6539 states and 23954 transitions. Word has length 54 [2025-04-13 23:32:06,212 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:06,212 INFO L485 AbstractCegarLoop]: Abstraction has 6539 states and 23954 transitions. [2025-04-13 23:32:06,212 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:06,212 INFO L278 IsEmpty]: Start isEmpty. Operand 6539 states and 23954 transitions. [2025-04-13 23:32:06,223 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:06,223 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:06,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:06,223 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable311 [2025-04-13 23:32:06,223 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 23:32:06,224 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:06,224 INFO L85 PathProgramCache]: Analyzing trace with hash 818096911, now seen corresponding path program 313 times [2025-04-13 23:32:06,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:06,224 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059820280] [2025-04-13 23:32:06,224 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:32:06,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:06,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:06,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:06,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:06,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:06,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:06,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:06,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059820280] [2025-04-13 23:32:06,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059820280] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:06,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:06,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:06,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634650912] [2025-04-13 23:32:06,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:06,832 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:06,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:06,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:06,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:06,832 INFO L87 Difference]: Start difference. First operand 6539 states and 23954 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:07,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:07,838 INFO L93 Difference]: Finished difference Result 13241 states and 46885 transitions. [2025-04-13 23:32:07,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:07,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 23:32:07,838 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:07,901 INFO L225 Difference]: With dead ends: 13241 [2025-04-13 23:32:07,902 INFO L226 Difference]: Without dead ends: 13161 [2025-04-13 23:32:07,907 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:32:07,907 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 290 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:07,907 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 130 Invalid, 1719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:32:07,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13161 states. [2025-04-13 23:32:08,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13161 to 6529. [2025-04-13 23:32:08,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6529 states, 6528 states have (on average 3.6640625) internal successors, (23919), 6528 states have internal predecessors, (23919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:08,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6529 states to 6529 states and 23919 transitions. [2025-04-13 23:32:08,096 INFO L79 Accepts]: Start accepts. Automaton has 6529 states and 23919 transitions. Word has length 54 [2025-04-13 23:32:08,096 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:08,096 INFO L485 AbstractCegarLoop]: Abstraction has 6529 states and 23919 transitions. [2025-04-13 23:32:08,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 23:32:08,096 INFO L278 IsEmpty]: Start isEmpty. Operand 6529 states and 23919 transitions. [2025-04-13 23:32:08,107 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:08,107 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:08,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 23:32:08,107 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable312 [2025-04-13 23:32:08,107 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 23:32:08,107 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:08,107 INFO L85 PathProgramCache]: Analyzing trace with hash 24784647, now seen corresponding path program 314 times [2025-04-13 23:32:08,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:08,107 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670420055] [2025-04-13 23:32:08,107 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:32:08,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:08,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:08,120 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:08,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:32:08,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:08,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:08,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:08,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670420055] [2025-04-13 23:32:08,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670420055] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:08,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:08,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:08,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720467144] [2025-04-13 23:32:08,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:08,733 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:08,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:08,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:08,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:08,733 INFO L87 Difference]: Start difference. First operand 6529 states and 23919 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:09,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:09,613 INFO L93 Difference]: Finished difference Result 11518 states and 40827 transitions. [2025-04-13 23:32:09,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:09,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 23:32:09,613 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:09,668 INFO L225 Difference]: With dead ends: 11518 [2025-04-13 23:32:09,668 INFO L226 Difference]: Without dead ends: 11437 [2025-04-13 23:32:09,672 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:32:09,673 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 298 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:09,673 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 113 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1529 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:32:09,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11437 states. [2025-04-13 23:32:09,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11437 to 6519. [2025-04-13 23:32:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6519 states, 6518 states have (on average 3.6650813132862843) internal successors, (23889), 6518 states have internal predecessors, (23889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:09,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6519 states to 6519 states and 23889 transitions. [2025-04-13 23:32:09,850 INFO L79 Accepts]: Start accepts. Automaton has 6519 states and 23889 transitions. Word has length 54 [2025-04-13 23:32:09,850 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:09,850 INFO L485 AbstractCegarLoop]: Abstraction has 6519 states and 23889 transitions. [2025-04-13 23:32:09,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 23:32:09,850 INFO L278 IsEmpty]: Start isEmpty. Operand 6519 states and 23889 transitions. [2025-04-13 23:32:09,861 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:09,861 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:09,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 23:32:09,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable313 [2025-04-13 23:32:09,861 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 23:32:09,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:09,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1868555203, now seen corresponding path program 315 times [2025-04-13 23:32:09,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:09,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636154806] [2025-04-13 23:32:09,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:32:09,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:09,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:09,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:09,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:32:09,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:10,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:10,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:10,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636154806] [2025-04-13 23:32:10,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636154806] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:10,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:10,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:10,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194056293] [2025-04-13 23:32:10,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:10,495 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:10,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:10,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:10,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:10,496 INFO L87 Difference]: Start difference. First operand 6519 states and 23889 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:11,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:11,411 INFO L93 Difference]: Finished difference Result 13195 states and 46772 transitions. [2025-04-13 23:32:11,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:11,412 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:11,412 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:11,480 INFO L225 Difference]: With dead ends: 13195 [2025-04-13 23:32:11,480 INFO L226 Difference]: Without dead ends: 13051 [2025-04-13 23:32:11,486 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:32:11,486 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 299 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:11,486 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 93 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:32:11,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13051 states. [2025-04-13 23:32:11,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13051 to 6489. [2025-04-13 23:32:11,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6489 states, 6488 states have (on average 3.667385943279901) internal successors, (23794), 6488 states have internal predecessors, (23794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:11,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6489 states to 6489 states and 23794 transitions. [2025-04-13 23:32:11,673 INFO L79 Accepts]: Start accepts. Automaton has 6489 states and 23794 transitions. Word has length 54 [2025-04-13 23:32:11,673 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:11,673 INFO L485 AbstractCegarLoop]: Abstraction has 6489 states and 23794 transitions. [2025-04-13 23:32:11,673 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:11,673 INFO L278 IsEmpty]: Start isEmpty. Operand 6489 states and 23794 transitions. [2025-04-13 23:32:11,685 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:11,685 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:11,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:11,685 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable314 [2025-04-13 23:32:11,685 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 23:32:11,685 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:11,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1745365189, now seen corresponding path program 316 times [2025-04-13 23:32:11,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:11,685 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398672307] [2025-04-13 23:32:11,685 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:32:11,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:11,688 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:32:11,699 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 23:32:11,700 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:32:11,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:12,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:12,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:12,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398672307] [2025-04-13 23:32:12,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398672307] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:12,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:12,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:12,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771823336] [2025-04-13 23:32:12,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:12,352 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:12,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:12,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:12,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:12,352 INFO L87 Difference]: Start difference. First operand 6489 states and 23794 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:13,325 INFO L93 Difference]: Finished difference Result 11487 states and 40735 transitions. [2025-04-13 23:32:13,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:32:13,325 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:13,325 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:13,389 INFO L225 Difference]: With dead ends: 11487 [2025-04-13 23:32:13,390 INFO L226 Difference]: Without dead ends: 11419 [2025-04-13 23:32:13,396 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=451, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:32:13,397 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 339 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:13,397 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 115 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:32:13,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11419 states. [2025-04-13 23:32:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11419 to 6499. [2025-04-13 23:32:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6499 states, 6498 states have (on average 3.6655894121268084) internal successors, (23819), 6498 states have internal predecessors, (23819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:13,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6499 states to 6499 states and 23819 transitions. [2025-04-13 23:32:13,577 INFO L79 Accepts]: Start accepts. Automaton has 6499 states and 23819 transitions. Word has length 54 [2025-04-13 23:32:13,577 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:13,577 INFO L485 AbstractCegarLoop]: Abstraction has 6499 states and 23819 transitions. [2025-04-13 23:32:13,577 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:13,578 INFO L278 IsEmpty]: Start isEmpty. Operand 6499 states and 23819 transitions. [2025-04-13 23:32:13,588 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:13,589 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:13,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:13,589 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable315 [2025-04-13 23:32:13,589 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 23:32:13,589 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:13,589 INFO L85 PathProgramCache]: Analyzing trace with hash -176856387, now seen corresponding path program 317 times [2025-04-13 23:32:13,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:13,589 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011709699] [2025-04-13 23:32:13,589 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:32:13,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:13,592 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:13,603 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:13,603 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:32:13,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:14,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 23:32:14,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:14,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011709699] [2025-04-13 23:32:14,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011709699] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:14,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:14,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:14,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835080210] [2025-04-13 23:32:14,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:14,216 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:14,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:14,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:14,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:14,216 INFO L87 Difference]: Start difference. First operand 6499 states and 23819 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:15,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:15,198 INFO L93 Difference]: Finished difference Result 13403 states and 47387 transitions. [2025-04-13 23:32:15,199 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:15,199 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:15,199 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:15,266 INFO L225 Difference]: With dead ends: 13403 [2025-04-13 23:32:15,266 INFO L226 Difference]: Without dead ends: 13286 [2025-04-13 23:32:15,271 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 23:32:15,271 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 304 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:15,271 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 121 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:32:15,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13286 states. [2025-04-13 23:32:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13286 to 6598. [2025-04-13 23:32:15,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6598 states, 6597 states have (on average 3.6557526148249204) internal successors, (24117), 6597 states have internal predecessors, (24117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:15,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6598 states to 6598 states and 24117 transitions. [2025-04-13 23:32:15,479 INFO L79 Accepts]: Start accepts. Automaton has 6598 states and 24117 transitions. Word has length 54 [2025-04-13 23:32:15,480 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:15,480 INFO L485 AbstractCegarLoop]: Abstraction has 6598 states and 24117 transitions. [2025-04-13 23:32:15,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 23:32:15,480 INFO L278 IsEmpty]: Start isEmpty. Operand 6598 states and 24117 transitions. [2025-04-13 23:32:15,490 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:15,491 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:15,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:15,491 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable316 [2025-04-13 23:32:15,491 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 23:32:15,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:15,491 INFO L85 PathProgramCache]: Analyzing trace with hash 974887207, now seen corresponding path program 318 times [2025-04-13 23:32:15,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:15,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989542791] [2025-04-13 23:32:15,492 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:32:15,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:15,494 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:15,505 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:15,505 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:32:15,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:16,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 23:32:16,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:16,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989542791] [2025-04-13 23:32:16,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989542791] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:16,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:16,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:16,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998266708] [2025-04-13 23:32:16,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:16,143 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:16,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:16,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:16,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:16,144 INFO L87 Difference]: Start difference. First operand 6598 states and 24117 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:17,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:17,245 INFO L93 Difference]: Finished difference Result 11540 states and 40915 transitions. [2025-04-13 23:32:17,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:32:17,245 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:17,245 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:17,299 INFO L225 Difference]: With dead ends: 11540 [2025-04-13 23:32:17,299 INFO L226 Difference]: Without dead ends: 11460 [2025-04-13 23:32:17,303 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=451, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:32:17,303 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 283 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:17,303 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 117 Invalid, 1618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:32:17,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11460 states. [2025-04-13 23:32:17,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11460 to 6588. [2025-04-13 23:32:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6588 states, 6587 states have (on average 3.656748140276302) internal successors, (24087), 6587 states have internal predecessors, (24087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6588 states to 6588 states and 24087 transitions. [2025-04-13 23:32:17,473 INFO L79 Accepts]: Start accepts. Automaton has 6588 states and 24087 transitions. Word has length 54 [2025-04-13 23:32:17,474 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:17,474 INFO L485 AbstractCegarLoop]: Abstraction has 6588 states and 24087 transitions. [2025-04-13 23:32:17,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 23:32:17,474 INFO L278 IsEmpty]: Start isEmpty. Operand 6588 states and 24087 transitions. [2025-04-13 23:32:17,484 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:17,485 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:17,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 23:32:17,485 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable317 [2025-04-13 23:32:17,485 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 23:32:17,485 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:17,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1611923877, now seen corresponding path program 319 times [2025-04-13 23:32:17,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:17,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440994082] [2025-04-13 23:32:17,485 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:32:17,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:17,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:17,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:17,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:17,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:18,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:18,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:18,134 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440994082] [2025-04-13 23:32:18,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440994082] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:18,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:18,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:18,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195961998] [2025-04-13 23:32:18,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:18,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:18,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:18,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:18,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:18,135 INFO L87 Difference]: Start difference. First operand 6588 states and 24087 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:19,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:19,066 INFO L93 Difference]: Finished difference Result 13428 states and 47417 transitions. [2025-04-13 23:32:19,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:19,066 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:19,066 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:19,126 INFO L225 Difference]: With dead ends: 13428 [2025-04-13 23:32:19,126 INFO L226 Difference]: Without dead ends: 13357 [2025-04-13 23:32:19,131 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 23:32:19,131 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 327 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1548 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:19,131 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 110 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:32:19,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13357 states. [2025-04-13 23:32:19,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13357 to 6599. [2025-04-13 23:32:19,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6599 states, 6598 states have (on average 3.654743861776296) internal successors, (24114), 6598 states have internal predecessors, (24114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:19,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6599 states to 6599 states and 24114 transitions. [2025-04-13 23:32:19,313 INFO L79 Accepts]: Start accepts. Automaton has 6599 states and 24114 transitions. Word has length 54 [2025-04-13 23:32:19,313 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:19,313 INFO L485 AbstractCegarLoop]: Abstraction has 6599 states and 24114 transitions. [2025-04-13 23:32:19,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 23:32:19,314 INFO L278 IsEmpty]: Start isEmpty. Operand 6599 states and 24114 transitions. [2025-04-13 23:32:19,324 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:19,324 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:19,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 23:32:19,324 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable318 [2025-04-13 23:32:19,325 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 23:32:19,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:19,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1909770981, now seen corresponding path program 320 times [2025-04-13 23:32:19,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:19,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24532887] [2025-04-13 23:32:19,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:32:19,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:19,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:19,338 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:19,338 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:32:19,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:19,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 23:32:19,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:19,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24532887] [2025-04-13 23:32:19,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24532887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:19,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:19,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:19,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222243207] [2025-04-13 23:32:19,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:19,950 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:19,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:19,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:19,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:19,950 INFO L87 Difference]: Start difference. First operand 6599 states and 24114 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:20,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:20,925 INFO L93 Difference]: Finished difference Result 11497 states and 40782 transitions. [2025-04-13 23:32:20,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:32:20,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 23:32:20,925 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:20,978 INFO L225 Difference]: With dead ends: 11497 [2025-04-13 23:32:20,978 INFO L226 Difference]: Without dead ends: 11426 [2025-04-13 23:32:20,982 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=406, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:32:20,982 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 328 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:20,982 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 100 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:32:20,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11426 states. [2025-04-13 23:32:21,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11426 to 6599. [2025-04-13 23:32:21,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6599 states, 6598 states have (on average 3.654743861776296) internal successors, (24114), 6598 states have internal predecessors, (24114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:21,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6599 states to 6599 states and 24114 transitions. [2025-04-13 23:32:21,160 INFO L79 Accepts]: Start accepts. Automaton has 6599 states and 24114 transitions. Word has length 54 [2025-04-13 23:32:21,161 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:21,161 INFO L485 AbstractCegarLoop]: Abstraction has 6599 states and 24114 transitions. [2025-04-13 23:32:21,161 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:21,161 INFO L278 IsEmpty]: Start isEmpty. Operand 6599 states and 24114 transitions. [2025-04-13 23:32:21,171 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:21,171 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:21,171 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:21,171 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable319 [2025-04-13 23:32:21,172 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 23:32:21,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:21,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1742908093, now seen corresponding path program 321 times [2025-04-13 23:32:21,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:21,172 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903675981] [2025-04-13 23:32:21,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:32:21,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:21,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:21,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:21,185 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:32:21,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:21,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:21,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903675981] [2025-04-13 23:32:21,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903675981] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:21,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:21,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:21,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160648229] [2025-04-13 23:32:21,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:21,811 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:21,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:21,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:21,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:21,811 INFO L87 Difference]: Start difference. First operand 6599 states and 24114 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:22,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:22,809 INFO L93 Difference]: Finished difference Result 13368 states and 47253 transitions. [2025-04-13 23:32:22,810 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:22,810 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:22,810 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:22,870 INFO L225 Difference]: With dead ends: 13368 [2025-04-13 23:32:22,871 INFO L226 Difference]: Without dead ends: 13265 [2025-04-13 23:32:22,876 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:32:22,876 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 284 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:22,876 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 123 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:32:22,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13265 states. [2025-04-13 23:32:23,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13265 to 6577. [2025-04-13 23:32:23,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6577 states, 6576 states have (on average 3.6554136253041363) internal successors, (24038), 6576 states have internal predecessors, (24038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6577 states to 6577 states and 24038 transitions. [2025-04-13 23:32:23,061 INFO L79 Accepts]: Start accepts. Automaton has 6577 states and 24038 transitions. Word has length 54 [2025-04-13 23:32:23,061 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:23,061 INFO L485 AbstractCegarLoop]: Abstraction has 6577 states and 24038 transitions. [2025-04-13 23:32:23,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 23:32:23,061 INFO L278 IsEmpty]: Start isEmpty. Operand 6577 states and 24038 transitions. [2025-04-13 23:32:23,072 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:23,072 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:23,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 23:32:23,072 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable320 [2025-04-13 23:32:23,072 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 23:32:23,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:23,072 INFO L85 PathProgramCache]: Analyzing trace with hash 969635655, now seen corresponding path program 322 times [2025-04-13 23:32:23,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:23,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478350074] [2025-04-13 23:32:23,072 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:32:23,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:23,075 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:32:23,086 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 23:32:23,086 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:32:23,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:23,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:23,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478350074] [2025-04-13 23:32:23,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478350074] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:23,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:23,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:23,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831212414] [2025-04-13 23:32:23,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:23,745 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:23,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:23,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:23,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:23,746 INFO L87 Difference]: Start difference. First operand 6577 states and 24038 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:24,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:24,555 INFO L93 Difference]: Finished difference Result 11415 states and 40553 transitions. [2025-04-13 23:32:24,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:32:24,555 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:24,555 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:24,604 INFO L225 Difference]: With dead ends: 11415 [2025-04-13 23:32:24,604 INFO L226 Difference]: Without dead ends: 11329 [2025-04-13 23:32:24,607 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 23:32:24,607 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 279 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:24,607 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 100 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:32:24,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11329 states. [2025-04-13 23:32:24,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11329 to 6561. [2025-04-13 23:32:24,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6561 states, 6560 states have (on average 3.6579268292682925) internal successors, (23996), 6560 states have internal predecessors, (23996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:24,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6561 states to 6561 states and 23996 transitions. [2025-04-13 23:32:24,768 INFO L79 Accepts]: Start accepts. Automaton has 6561 states and 23996 transitions. Word has length 54 [2025-04-13 23:32:24,768 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:24,768 INFO L485 AbstractCegarLoop]: Abstraction has 6561 states and 23996 transitions. [2025-04-13 23:32:24,768 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:24,768 INFO L278 IsEmpty]: Start isEmpty. Operand 6561 states and 23996 transitions. [2025-04-13 23:32:24,779 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:24,779 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:24,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:24,779 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable321 [2025-04-13 23:32:24,779 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 23:32:24,779 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:24,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1530524821, now seen corresponding path program 323 times [2025-04-13 23:32:24,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:24,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937812658] [2025-04-13 23:32:24,780 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:32:24,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:24,782 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:24,794 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:24,794 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:32:24,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:25,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 23:32:25,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:25,400 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937812658] [2025-04-13 23:32:25,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937812658] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:25,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:25,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:25,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828241753] [2025-04-13 23:32:25,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:25,400 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:25,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:25,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:25,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:25,401 INFO L87 Difference]: Start difference. First operand 6561 states and 23996 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:26,314 INFO L93 Difference]: Finished difference Result 13341 states and 47173 transitions. [2025-04-13 23:32:26,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:26,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 23:32:26,314 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:26,391 INFO L225 Difference]: With dead ends: 13341 [2025-04-13 23:32:26,391 INFO L226 Difference]: Without dead ends: 13270 [2025-04-13 23:32:26,397 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 23:32:26,397 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 303 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:26,397 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 118 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:32:26,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13270 states. [2025-04-13 23:32:26,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13270 to 6594. [2025-04-13 23:32:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6594 states, 6593 states have (on average 3.6552404064917337) internal successors, (24099), 6593 states have internal predecessors, (24099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6594 states to 6594 states and 24099 transitions. [2025-04-13 23:32:26,588 INFO L79 Accepts]: Start accepts. Automaton has 6594 states and 24099 transitions. Word has length 54 [2025-04-13 23:32:26,588 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:26,588 INFO L485 AbstractCegarLoop]: Abstraction has 6594 states and 24099 transitions. [2025-04-13 23:32:26,588 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:26,588 INFO L278 IsEmpty]: Start isEmpty. Operand 6594 states and 24099 transitions. [2025-04-13 23:32:26,599 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:26,600 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:26,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 23:32:26,600 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable322 [2025-04-13 23:32:26,600 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 23:32:26,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:26,600 INFO L85 PathProgramCache]: Analyzing trace with hash 778382569, now seen corresponding path program 324 times [2025-04-13 23:32:26,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:26,600 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684316551] [2025-04-13 23:32:26,600 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:32:26,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:26,603 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:26,638 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:26,638 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:32:26,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:27,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:27,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:27,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684316551] [2025-04-13 23:32:27,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684316551] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:27,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:27,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:27,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092676005] [2025-04-13 23:32:27,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:27,301 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:27,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:27,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:27,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:27,301 INFO L87 Difference]: Start difference. First operand 6594 states and 24099 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:28,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:28,279 INFO L93 Difference]: Finished difference Result 11558 states and 40972 transitions. [2025-04-13 23:32:28,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:32:28,279 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:28,279 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:28,347 INFO L225 Difference]: With dead ends: 11558 [2025-04-13 23:32:28,347 INFO L226 Difference]: Without dead ends: 11450 [2025-04-13 23:32:28,351 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:32:28,351 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 284 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:28,351 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 132 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:32:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11450 states. [2025-04-13 23:32:28,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11450 to 6614. [2025-04-13 23:32:28,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6614 states, 6613 states have (on average 3.651746559806442) internal successors, (24149), 6613 states have internal predecessors, (24149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:28,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6614 states to 6614 states and 24149 transitions. [2025-04-13 23:32:28,527 INFO L79 Accepts]: Start accepts. Automaton has 6614 states and 24149 transitions. Word has length 54 [2025-04-13 23:32:28,527 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:28,527 INFO L485 AbstractCegarLoop]: Abstraction has 6614 states and 24149 transitions. [2025-04-13 23:32:28,527 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:28,527 INFO L278 IsEmpty]: Start isEmpty. Operand 6614 states and 24149 transitions. [2025-04-13 23:32:28,538 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:28,538 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:28,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:28,538 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable323 [2025-04-13 23:32:28,538 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 23:32:28,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:28,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1824307149, now seen corresponding path program 325 times [2025-04-13 23:32:28,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:28,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317805750] [2025-04-13 23:32:28,539 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:32:28,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:28,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:28,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:28,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:28,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:29,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:29,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317805750] [2025-04-13 23:32:29,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317805750] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:29,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:29,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:29,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570796631] [2025-04-13 23:32:29,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:29,206 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:29,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:29,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:29,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:29,206 INFO L87 Difference]: Start difference. First operand 6614 states and 24149 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:30,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:30,160 INFO L93 Difference]: Finished difference Result 13360 states and 47210 transitions. [2025-04-13 23:32:30,160 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:30,160 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:30,160 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:30,217 INFO L225 Difference]: With dead ends: 13360 [2025-04-13 23:32:30,217 INFO L226 Difference]: Without dead ends: 13279 [2025-04-13 23:32:30,222 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:32:30,222 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 304 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:30,222 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 116 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:32:30,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13279 states. [2025-04-13 23:32:30,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13279 to 6603. [2025-04-13 23:32:30,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6603 states, 6602 states have (on average 3.652075128748864) internal successors, (24111), 6602 states have internal predecessors, (24111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:30,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6603 states to 6603 states and 24111 transitions. [2025-04-13 23:32:30,405 INFO L79 Accepts]: Start accepts. Automaton has 6603 states and 24111 transitions. Word has length 54 [2025-04-13 23:32:30,405 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:30,405 INFO L485 AbstractCegarLoop]: Abstraction has 6603 states and 24111 transitions. [2025-04-13 23:32:30,405 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:30,405 INFO L278 IsEmpty]: Start isEmpty. Operand 6603 states and 24111 transitions. [2025-04-13 23:32:30,416 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:30,416 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:30,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 23:32:30,416 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable324 [2025-04-13 23:32:30,416 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 23:32:30,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:30,416 INFO L85 PathProgramCache]: Analyzing trace with hash 307725447, now seen corresponding path program 326 times [2025-04-13 23:32:30,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:30,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460598499] [2025-04-13 23:32:30,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:32:30,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:30,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:30,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:30,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:32:30,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:31,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:31,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:31,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460598499] [2025-04-13 23:32:31,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460598499] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:31,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:31,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:31,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196265821] [2025-04-13 23:32:31,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:31,034 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:31,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:31,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:31,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:31,034 INFO L87 Difference]: Start difference. First operand 6603 states and 24111 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:32,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:32,021 INFO L93 Difference]: Finished difference Result 11519 states and 40834 transitions. [2025-04-13 23:32:32,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:32,021 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:32,021 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:32,074 INFO L225 Difference]: With dead ends: 11519 [2025-04-13 23:32:32,074 INFO L226 Difference]: Without dead ends: 11451 [2025-04-13 23:32:32,080 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:32:32,080 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 315 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:32,080 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 108 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:32:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11451 states. [2025-04-13 23:32:32,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11451 to 6613. [2025-04-13 23:32:32,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6613 states, 6612 states have (on average 3.6503327283726557) internal successors, (24136), 6612 states have internal predecessors, (24136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6613 states to 6613 states and 24136 transitions. [2025-04-13 23:32:32,250 INFO L79 Accepts]: Start accepts. Automaton has 6613 states and 24136 transitions. Word has length 54 [2025-04-13 23:32:32,250 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:32,250 INFO L485 AbstractCegarLoop]: Abstraction has 6613 states and 24136 transitions. [2025-04-13 23:32:32,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 23:32:32,250 INFO L278 IsEmpty]: Start isEmpty. Operand 6613 states and 24136 transitions. [2025-04-13 23:32:32,261 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:32,261 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:32,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:32,261 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable325 [2025-04-13 23:32:32,261 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 23:32:32,261 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:32,261 INFO L85 PathProgramCache]: Analyzing trace with hash -857093413, now seen corresponding path program 327 times [2025-04-13 23:32:32,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:32,261 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464703607] [2025-04-13 23:32:32,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:32:32,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:32,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:32,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:32,275 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:32:32,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:32,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 23:32:32,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:32,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464703607] [2025-04-13 23:32:32,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464703607] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:32,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:32,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:32,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558005202] [2025-04-13 23:32:32,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:32,889 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:32,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:32,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:32,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:32,889 INFO L87 Difference]: Start difference. First operand 6613 states and 24136 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:33,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:33,883 INFO L93 Difference]: Finished difference Result 13289 states and 47019 transitions. [2025-04-13 23:32:33,883 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:33,883 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:33,883 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:33,936 INFO L225 Difference]: With dead ends: 13289 [2025-04-13 23:32:33,936 INFO L226 Difference]: Without dead ends: 13011 [2025-04-13 23:32:33,942 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 23:32:33,942 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 294 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:33,942 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 120 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:32:33,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13011 states. [2025-04-13 23:32:34,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13011 to 6449. [2025-04-13 23:32:34,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6449 states, 6448 states have (on average 3.6681141439205955) internal successors, (23652), 6448 states have internal predecessors, (23652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:34,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6449 states to 6449 states and 23652 transitions. [2025-04-13 23:32:34,110 INFO L79 Accepts]: Start accepts. Automaton has 6449 states and 23652 transitions. Word has length 54 [2025-04-13 23:32:34,110 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:34,110 INFO L485 AbstractCegarLoop]: Abstraction has 6449 states and 23652 transitions. [2025-04-13 23:32:34,110 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:34,110 INFO L278 IsEmpty]: Start isEmpty. Operand 6449 states and 23652 transitions. [2025-04-13 23:32:34,121 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:34,121 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:34,121 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:34,121 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable326 [2025-04-13 23:32:34,121 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 23:32:34,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:34,121 INFO L85 PathProgramCache]: Analyzing trace with hash -462752535, now seen corresponding path program 328 times [2025-04-13 23:32:34,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:34,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719066678] [2025-04-13 23:32:34,121 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:32:34,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:34,124 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:32:34,136 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 23:32:34,136 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:32:34,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:34,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:34,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:34,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719066678] [2025-04-13 23:32:34,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719066678] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:34,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:34,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 23:32:34,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673563695] [2025-04-13 23:32:34,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:34,711 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:32:34,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:34,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:32:34,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:32:34,711 INFO L87 Difference]: Start difference. First operand 6449 states and 23652 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:35,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:35,696 INFO L93 Difference]: Finished difference Result 12857 states and 45231 transitions. [2025-04-13 23:32:35,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 23:32:35,696 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:35,697 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:35,754 INFO L225 Difference]: With dead ends: 12857 [2025-04-13 23:32:35,754 INFO L226 Difference]: Without dead ends: 12747 [2025-04-13 23:32:35,759 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=553, Unknown=0, NotChecked=0, Total=812 [2025-04-13 23:32:35,759 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 354 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:35,759 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 129 Invalid, 1767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:32:35,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12747 states. [2025-04-13 23:32:35,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12747 to 6409. [2025-04-13 23:32:35,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6409 states, 6408 states have (on average 3.673845193508115) internal successors, (23542), 6408 states have internal predecessors, (23542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6409 states to 6409 states and 23542 transitions. [2025-04-13 23:32:35,991 INFO L79 Accepts]: Start accepts. Automaton has 6409 states and 23542 transitions. Word has length 54 [2025-04-13 23:32:35,991 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:35,991 INFO L485 AbstractCegarLoop]: Abstraction has 6409 states and 23542 transitions. [2025-04-13 23:32:35,991 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:35,992 INFO L278 IsEmpty]: Start isEmpty. Operand 6409 states and 23542 transitions. [2025-04-13 23:32:36,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:36,002 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:36,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:36,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable327 [2025-04-13 23:32:36,002 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 23:32:36,002 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:36,003 INFO L85 PathProgramCache]: Analyzing trace with hash -648431965, now seen corresponding path program 329 times [2025-04-13 23:32:36,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:36,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998593783] [2025-04-13 23:32:36,003 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:32:36,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:36,005 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:36,016 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:36,016 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:32:36,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:36,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 23:32:36,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:36,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998593783] [2025-04-13 23:32:36,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998593783] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:36,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:36,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:36,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027388205] [2025-04-13 23:32:36,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:36,598 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:36,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:36,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:36,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:36,598 INFO L87 Difference]: Start difference. First operand 6409 states and 23542 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:37,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:37,565 INFO L93 Difference]: Finished difference Result 12808 states and 45502 transitions. [2025-04-13 23:32:37,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:37,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 23:32:37,565 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:37,624 INFO L225 Difference]: With dead ends: 12808 [2025-04-13 23:32:37,625 INFO L226 Difference]: Without dead ends: 12691 [2025-04-13 23:32:37,629 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 23:32:37,630 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 291 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 1625 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:37,630 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 127 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1625 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:32:37,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12691 states. [2025-04-13 23:32:37,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12691 to 6598. [2025-04-13 23:32:37,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6598 states, 6597 states have (on average 3.656055782931636) internal successors, (24119), 6597 states have internal predecessors, (24119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6598 states to 6598 states and 24119 transitions. [2025-04-13 23:32:37,815 INFO L79 Accepts]: Start accepts. Automaton has 6598 states and 24119 transitions. Word has length 54 [2025-04-13 23:32:37,815 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:37,815 INFO L485 AbstractCegarLoop]: Abstraction has 6598 states and 24119 transitions. [2025-04-13 23:32:37,815 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:37,815 INFO L278 IsEmpty]: Start isEmpty. Operand 6598 states and 24119 transitions. [2025-04-13 23:32:37,826 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:37,826 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:37,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:37,826 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable328 [2025-04-13 23:32:37,826 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 23:32:37,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:37,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1698581513, now seen corresponding path program 330 times [2025-04-13 23:32:37,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:37,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416434510] [2025-04-13 23:32:37,826 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:32:37,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:37,829 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:37,839 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:37,839 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:32:37,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:38,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:38,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:38,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416434510] [2025-04-13 23:32:38,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416434510] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:38,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:38,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:38,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352780100] [2025-04-13 23:32:38,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:38,556 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:38,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:38,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:38,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:38,556 INFO L87 Difference]: Start difference. First operand 6598 states and 24119 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:39,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:39,406 INFO L93 Difference]: Finished difference Result 11578 states and 41058 transitions. [2025-04-13 23:32:39,406 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:39,406 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:39,407 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:39,460 INFO L225 Difference]: With dead ends: 11578 [2025-04-13 23:32:39,460 INFO L226 Difference]: Without dead ends: 11510 [2025-04-13 23:32:39,464 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 23:32:39,464 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 307 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:39,464 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 114 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:32:39,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11510 states. [2025-04-13 23:32:39,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11510 to 6623. [2025-04-13 23:32:39,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6623 states, 6622 states have (on average 3.655089096949562) internal successors, (24204), 6622 states have internal predecessors, (24204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:39,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6623 states to 6623 states and 24204 transitions. [2025-04-13 23:32:39,633 INFO L79 Accepts]: Start accepts. Automaton has 6623 states and 24204 transitions. Word has length 54 [2025-04-13 23:32:39,634 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:39,634 INFO L485 AbstractCegarLoop]: Abstraction has 6623 states and 24204 transitions. [2025-04-13 23:32:39,634 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:39,634 INFO L278 IsEmpty]: Start isEmpty. Operand 6623 states and 24204 transitions. [2025-04-13 23:32:39,644 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:39,645 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:39,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 23:32:39,645 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable329 [2025-04-13 23:32:39,645 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 23:32:39,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:39,645 INFO L85 PathProgramCache]: Analyzing trace with hash -851060991, now seen corresponding path program 331 times [2025-04-13 23:32:39,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:39,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137912570] [2025-04-13 23:32:39,645 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:32:39,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:39,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:39,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:39,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:39,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:40,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 23:32:40,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:40,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137912570] [2025-04-13 23:32:40,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137912570] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:40,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:40,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:40,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134296345] [2025-04-13 23:32:40,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:40,314 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:40,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:40,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:40,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:40,314 INFO L87 Difference]: Start difference. First operand 6623 states and 24204 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:41,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:41,202 INFO L93 Difference]: Finished difference Result 12868 states and 45647 transitions. [2025-04-13 23:32:41,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:41,203 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:41,203 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:41,263 INFO L225 Difference]: With dead ends: 12868 [2025-04-13 23:32:41,263 INFO L226 Difference]: Without dead ends: 12797 [2025-04-13 23:32:41,268 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 23:32:41,269 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 317 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1468 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:41,269 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 112 Invalid, 1492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1468 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:32:41,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12797 states. [2025-04-13 23:32:41,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12797 to 6634. [2025-04-13 23:32:41,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6634 states, 6633 states have (on average 3.653098145635459) internal successors, (24231), 6633 states have internal predecessors, (24231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6634 states to 6634 states and 24231 transitions. [2025-04-13 23:32:41,449 INFO L79 Accepts]: Start accepts. Automaton has 6634 states and 24231 transitions. Word has length 54 [2025-04-13 23:32:41,449 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:41,449 INFO L485 AbstractCegarLoop]: Abstraction has 6634 states and 24231 transitions. [2025-04-13 23:32:41,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 23:32:41,449 INFO L278 IsEmpty]: Start isEmpty. Operand 6634 states and 24231 transitions. [2025-04-13 23:32:41,460 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:41,460 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:41,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:41,460 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable330 [2025-04-13 23:32:41,460 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 23:32:41,460 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:41,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1796381207, now seen corresponding path program 332 times [2025-04-13 23:32:41,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:41,460 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270278647] [2025-04-13 23:32:41,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:32:41,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:41,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:41,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:41,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:32:41,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:42,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 23:32:42,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:42,207 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270278647] [2025-04-13 23:32:42,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270278647] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:42,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:42,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:42,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254594236] [2025-04-13 23:32:42,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:42,207 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:42,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:42,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:42,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:42,207 INFO L87 Difference]: Start difference. First operand 6634 states and 24231 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:43,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:43,013 INFO L93 Difference]: Finished difference Result 11592 states and 41082 transitions. [2025-04-13 23:32:43,013 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:43,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 23:32:43,013 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:43,065 INFO L225 Difference]: With dead ends: 11592 [2025-04-13 23:32:43,065 INFO L226 Difference]: Without dead ends: 11511 [2025-04-13 23:32:43,070 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:32:43,070 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 311 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:43,070 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 112 Invalid, 1524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1505 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:32:43,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11511 states. [2025-04-13 23:32:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11511 to 6624. [2025-04-13 23:32:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6624 states, 6623 states have (on average 3.654084251849615) internal successors, (24201), 6623 states have internal predecessors, (24201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6624 states to 6624 states and 24201 transitions. [2025-04-13 23:32:43,250 INFO L79 Accepts]: Start accepts. Automaton has 6624 states and 24201 transitions. Word has length 54 [2025-04-13 23:32:43,251 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:43,251 INFO L485 AbstractCegarLoop]: Abstraction has 6624 states and 24201 transitions. [2025-04-13 23:32:43,251 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:43,251 INFO L278 IsEmpty]: Start isEmpty. Operand 6624 states and 24201 transitions. [2025-04-13 23:32:43,262 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:43,262 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:43,262 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:43,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable331 [2025-04-13 23:32:43,262 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 23:32:43,262 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:43,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1909076333, now seen corresponding path program 333 times [2025-04-13 23:32:43,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:43,262 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072058749] [2025-04-13 23:32:43,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:32:43,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:43,265 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:43,276 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:43,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:32:43,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:43,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:43,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072058749] [2025-04-13 23:32:43,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072058749] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:43,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:43,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:43,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5328256] [2025-04-13 23:32:43,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:43,909 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:43,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:43,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:43,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:43,910 INFO L87 Difference]: Start difference. First operand 6624 states and 24201 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:44,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:44,796 INFO L93 Difference]: Finished difference Result 12787 states and 45426 transitions. [2025-04-13 23:32:44,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:44,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 23:32:44,797 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:44,855 INFO L225 Difference]: With dead ends: 12787 [2025-04-13 23:32:44,855 INFO L226 Difference]: Without dead ends: 12684 [2025-04-13 23:32:44,860 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:32:44,860 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 303 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:44,860 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 111 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:32:44,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12684 states. [2025-04-13 23:32:44,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12684 to 6591. [2025-04-13 23:32:44,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6591 states, 6590 states have (on average 3.656752655538695) internal successors, (24098), 6590 states have internal predecessors, (24098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:45,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6591 states to 6591 states and 24098 transitions. [2025-04-13 23:32:45,039 INFO L79 Accepts]: Start accepts. Automaton has 6591 states and 24098 transitions. Word has length 54 [2025-04-13 23:32:45,039 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:45,039 INFO L485 AbstractCegarLoop]: Abstraction has 6591 states and 24098 transitions. [2025-04-13 23:32:45,039 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:45,039 INFO L278 IsEmpty]: Start isEmpty. Operand 6591 states and 24098 transitions. [2025-04-13 23:32:45,049 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:45,049 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:45,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 23:32:45,050 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable332 [2025-04-13 23:32:45,050 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 23:32:45,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:45,050 INFO L85 PathProgramCache]: Analyzing trace with hash -778005547, now seen corresponding path program 334 times [2025-04-13 23:32:45,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:45,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407082435] [2025-04-13 23:32:45,050 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:32:45,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:45,053 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:32:45,063 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 23:32:45,063 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:32:45,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:45,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 23:32:45,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:45,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407082435] [2025-04-13 23:32:45,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407082435] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:45,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:45,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 23:32:45,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928531261] [2025-04-13 23:32:45,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:45,646 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:32:45,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:45,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:32:45,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:32:45,646 INFO L87 Difference]: Start difference. First operand 6591 states and 24098 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:46,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:46,652 INFO L93 Difference]: Finished difference Result 13196 states and 46219 transitions. [2025-04-13 23:32:46,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:32:46,652 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:46,652 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:46,713 INFO L225 Difference]: With dead ends: 13196 [2025-04-13 23:32:46,713 INFO L226 Difference]: Without dead ends: 13128 [2025-04-13 23:32:46,718 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=559, Unknown=0, NotChecked=0, Total=812 [2025-04-13 23:32:46,718 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 420 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:46,718 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 126 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:32:46,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13128 states. [2025-04-13 23:32:46,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13128 to 6601. [2025-04-13 23:32:46,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6601 states, 6600 states have (on average 3.655) internal successors, (24123), 6600 states have internal predecessors, (24123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:46,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6601 states to 6601 states and 24123 transitions. [2025-04-13 23:32:46,922 INFO L79 Accepts]: Start accepts. Automaton has 6601 states and 24123 transitions. Word has length 54 [2025-04-13 23:32:46,922 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:46,922 INFO L485 AbstractCegarLoop]: Abstraction has 6601 states and 24123 transitions. [2025-04-13 23:32:46,922 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:46,922 INFO L278 IsEmpty]: Start isEmpty. Operand 6601 states and 24123 transitions. [2025-04-13 23:32:46,933 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:46,933 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:46,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:46,933 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable333 [2025-04-13 23:32:46,933 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 23:32:46,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:46,934 INFO L85 PathProgramCache]: Analyzing trace with hash -796723485, now seen corresponding path program 335 times [2025-04-13 23:32:46,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:46,934 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370887643] [2025-04-13 23:32:46,934 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:32:46,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:46,936 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:46,947 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:46,948 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:32:46,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:47,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 23:32:47,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:47,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370887643] [2025-04-13 23:32:47,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370887643] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:47,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:47,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:47,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811420062] [2025-04-13 23:32:47,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:47,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:47,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:47,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:47,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:47,538 INFO L87 Difference]: Start difference. First operand 6601 states and 24123 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:48,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:48,425 INFO L93 Difference]: Finished difference Result 12786 states and 45413 transitions. [2025-04-13 23:32:48,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:48,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 23:32:48,425 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:48,487 INFO L225 Difference]: With dead ends: 12786 [2025-04-13 23:32:48,487 INFO L226 Difference]: Without dead ends: 12715 [2025-04-13 23:32:48,492 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 23:32:48,492 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 311 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:48,492 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 107 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:32:48,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12715 states. [2025-04-13 23:32:48,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12715 to 6634. [2025-04-13 23:32:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6634 states, 6633 states have (on average 3.652344338911503) internal successors, (24226), 6633 states have internal predecessors, (24226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6634 states to 6634 states and 24226 transitions. [2025-04-13 23:32:48,664 INFO L79 Accepts]: Start accepts. Automaton has 6634 states and 24226 transitions. Word has length 54 [2025-04-13 23:32:48,665 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:48,665 INFO L485 AbstractCegarLoop]: Abstraction has 6634 states and 24226 transitions. [2025-04-13 23:32:48,665 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:48,665 INFO L278 IsEmpty]: Start isEmpty. Operand 6634 states and 24226 transitions. [2025-04-13 23:32:48,675 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:48,675 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:48,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:48,676 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable334 [2025-04-13 23:32:48,676 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 23:32:48,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:48,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1548483529, now seen corresponding path program 336 times [2025-04-13 23:32:48,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:48,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000288] [2025-04-13 23:32:48,676 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:32:48,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:48,678 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32: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 23:32:48,689 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:32:48,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:49,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:49,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:49,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000288] [2025-04-13 23:32:49,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000288] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:49,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:49,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:49,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711361443] [2025-04-13 23:32:49,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:49,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:49,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:49,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:49,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:49,312 INFO L87 Difference]: Start difference. First operand 6634 states and 24226 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:50,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:50,303 INFO L93 Difference]: Finished difference Result 11613 states and 41140 transitions. [2025-04-13 23:32:50,303 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:50,303 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:50,303 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:50,356 INFO L225 Difference]: With dead ends: 11613 [2025-04-13 23:32:50,356 INFO L226 Difference]: Without dead ends: 11533 [2025-04-13 23:32:50,360 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:32:50,360 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 286 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:50,360 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 124 Invalid, 1664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:32:50,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11533 states. [2025-04-13 23:32:50,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11533 to 6624. [2025-04-13 23:32:50,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6624 states, 6623 states have (on average 3.653329306960592) internal successors, (24196), 6623 states have internal predecessors, (24196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6624 states to 6624 states and 24196 transitions. [2025-04-13 23:32:50,527 INFO L79 Accepts]: Start accepts. Automaton has 6624 states and 24196 transitions. Word has length 54 [2025-04-13 23:32:50,527 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:50,527 INFO L485 AbstractCegarLoop]: Abstraction has 6624 states and 24196 transitions. [2025-04-13 23:32:50,528 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:50,528 INFO L278 IsEmpty]: Start isEmpty. Operand 6624 states and 24196 transitions. [2025-04-13 23:32:50,538 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:50,539 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:50,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 23:32:50,539 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable335 [2025-04-13 23:32:50,539 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 23:32:50,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:50,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1963413839, now seen corresponding path program 337 times [2025-04-13 23:32:50,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:50,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291250200] [2025-04-13 23:32:50,539 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:32:50,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:50,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:50,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:50,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:50,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:51,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 23:32:51,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:51,185 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291250200] [2025-04-13 23:32:51,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291250200] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:51,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:51,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:51,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742618119] [2025-04-13 23:32:51,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:51,185 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:51,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:51,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:51,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:51,186 INFO L87 Difference]: Start difference. First operand 6624 states and 24196 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:52,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:52,077 INFO L93 Difference]: Finished difference Result 12775 states and 45370 transitions. [2025-04-13 23:32:52,077 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:52,078 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:52,078 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:52,134 INFO L225 Difference]: With dead ends: 12775 [2025-04-13 23:32:52,134 INFO L226 Difference]: Without dead ends: 12694 [2025-04-13 23:32:52,141 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:32:52,141 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 289 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1501 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:52,141 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 111 Invalid, 1524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1501 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:32:52,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12694 states. [2025-04-13 23:32:52,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12694 to 6613. [2025-04-13 23:32:52,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6613 states, 6612 states have (on average 3.6536600120992135) internal successors, (24158), 6612 states have internal predecessors, (24158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:52,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6613 states to 6613 states and 24158 transitions. [2025-04-13 23:32:52,318 INFO L79 Accepts]: Start accepts. Automaton has 6613 states and 24158 transitions. Word has length 54 [2025-04-13 23:32:52,319 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:52,319 INFO L485 AbstractCegarLoop]: Abstraction has 6613 states and 24158 transitions. [2025-04-13 23:32:52,319 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:52,319 INFO L278 IsEmpty]: Start isEmpty. Operand 6613 states and 24158 transitions. [2025-04-13 23:32:52,329 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:52,329 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:52,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 23:32:52,329 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable336 [2025-04-13 23:32:52,329 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 23:32:52,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:52,330 INFO L85 PathProgramCache]: Analyzing trace with hash -613599755, now seen corresponding path program 338 times [2025-04-13 23:32:52,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:52,330 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178399390] [2025-04-13 23:32:52,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:32:52,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:52,332 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:52,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:52,344 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:32:52,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:52,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 23:32:52,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:52,932 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178399390] [2025-04-13 23:32:52,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178399390] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:52,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:52,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:52,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565207889] [2025-04-13 23:32:52,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:52,932 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:52,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:52,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:52,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:52,933 INFO L87 Difference]: Start difference. First operand 6613 states and 24158 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:53,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:53,890 INFO L93 Difference]: Finished difference Result 11652 states and 41225 transitions. [2025-04-13 23:32:53,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:53,890 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:53,890 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:53,940 INFO L225 Difference]: With dead ends: 11652 [2025-04-13 23:32:53,940 INFO L226 Difference]: Without dead ends: 11581 [2025-04-13 23:32:53,944 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:32:53,945 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 323 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1468 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:53,945 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 109 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1468 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:32:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11581 states. [2025-04-13 23:32:54,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11581 to 6624. [2025-04-13 23:32:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6624 states, 6623 states have (on average 3.651668428204741) internal successors, (24185), 6623 states have internal predecessors, (24185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:54,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6624 states to 6624 states and 24185 transitions. [2025-04-13 23:32:54,106 INFO L79 Accepts]: Start accepts. Automaton has 6624 states and 24185 transitions. Word has length 54 [2025-04-13 23:32:54,106 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:54,106 INFO L485 AbstractCegarLoop]: Abstraction has 6624 states and 24185 transitions. [2025-04-13 23:32:54,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 23:32:54,106 INFO L278 IsEmpty]: Start isEmpty. Operand 6624 states and 24185 transitions. [2025-04-13 23:32:54,116 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:54,116 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:54,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:54,117 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable337 [2025-04-13 23:32:54,117 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 23:32:54,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:54,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1071239133, now seen corresponding path program 339 times [2025-04-13 23:32:54,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:54,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472399230] [2025-04-13 23:32:54,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:32:54,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:54,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:54,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:54,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:32:54,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:54,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 23:32:54,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:54,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472399230] [2025-04-13 23:32:54,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472399230] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:54,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:54,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:54,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623562658] [2025-04-13 23:32:54,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:54,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:54,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:54,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:54,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:54,707 INFO L87 Difference]: Start difference. First operand 6624 states and 24185 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:55,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:55,578 INFO L93 Difference]: Finished difference Result 12705 states and 45181 transitions. [2025-04-13 23:32:55,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:55,578 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:55,578 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:55,633 INFO L225 Difference]: With dead ends: 12705 [2025-04-13 23:32:55,633 INFO L226 Difference]: Without dead ends: 12426 [2025-04-13 23:32:55,638 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 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 23:32:55,638 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 282 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:55,638 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 114 Invalid, 1492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:32:55,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12426 states. [2025-04-13 23:32:55,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12426 to 6459. [2025-04-13 23:32:55,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6459 states, 6458 states have (on average 3.6666150510994115) internal successors, (23679), 6458 states have internal predecessors, (23679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:55,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6459 states to 6459 states and 23679 transitions. [2025-04-13 23:32:55,872 INFO L79 Accepts]: Start accepts. Automaton has 6459 states and 23679 transitions. Word has length 54 [2025-04-13 23:32:55,872 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:55,872 INFO L485 AbstractCegarLoop]: Abstraction has 6459 states and 23679 transitions. [2025-04-13 23:32:55,872 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:55,872 INFO L278 IsEmpty]: Start isEmpty. Operand 6459 states and 23679 transitions. [2025-04-13 23:32:55,882 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:55,882 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:55,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:55,883 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable338 [2025-04-13 23:32:55,883 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 23:32:55,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:55,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1553735081, now seen corresponding path program 340 times [2025-04-13 23:32:55,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:55,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765238203] [2025-04-13 23:32:55,883 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:32:55,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:55,887 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:32:55,900 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 23:32:55,901 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:32:55,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:56,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:56,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765238203] [2025-04-13 23:32:56,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765238203] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:56,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:56,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 23:32:56,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004758525] [2025-04-13 23:32:56,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:56,501 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:32:56,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:56,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:32:56,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:32:56,501 INFO L87 Difference]: Start difference. First operand 6459 states and 23679 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:57,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:57,397 INFO L93 Difference]: Finished difference Result 13008 states and 45657 transitions. [2025-04-13 23:32:57,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 23:32:57,398 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:57,398 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:57,457 INFO L225 Difference]: With dead ends: 13008 [2025-04-13 23:32:57,457 INFO L226 Difference]: Without dead ends: 12922 [2025-04-13 23:32:57,462 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=256, Invalid=556, Unknown=0, NotChecked=0, Total=812 [2025-04-13 23:32:57,463 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 439 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:57,463 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 104 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:32:57,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12922 states. [2025-04-13 23:32:57,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12922 to 6443. [2025-04-13 23:32:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6443 states, 6442 states have (on average 3.669202111145607) internal successors, (23637), 6442 states have internal predecessors, (23637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:57,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6443 states to 6443 states and 23637 transitions. [2025-04-13 23:32:57,652 INFO L79 Accepts]: Start accepts. Automaton has 6443 states and 23637 transitions. Word has length 54 [2025-04-13 23:32:57,652 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:57,652 INFO L485 AbstractCegarLoop]: Abstraction has 6443 states and 23637 transitions. [2025-04-13 23:32:57,652 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:57,652 INFO L278 IsEmpty]: Start isEmpty. Operand 6443 states and 23637 transitions. [2025-04-13 23:32:57,663 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:57,663 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:57,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:57,663 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable339 [2025-04-13 23:32:57,663 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 23:32:57,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:57,663 INFO L85 PathProgramCache]: Analyzing trace with hash -432669573, now seen corresponding path program 341 times [2025-04-13 23:32:57,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:57,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984140066] [2025-04-13 23:32:57,663 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:32:57,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:57,666 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:57,676 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:57,676 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:32:57,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:32:58,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:32:58,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:32:58,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984140066] [2025-04-13 23:32:58,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984140066] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:32:58,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:32:58,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:32:58,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312987970] [2025-04-13 23:32:58,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:32:58,305 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:32:58,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:32:58,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:32:58,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:32:58,305 INFO L87 Difference]: Start difference. First operand 6443 states and 23637 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:59,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:59,298 INFO L93 Difference]: Finished difference Result 12690 states and 45165 transitions. [2025-04-13 23:32:59,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:32:59,298 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:32:59,298 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:59,353 INFO L225 Difference]: With dead ends: 12690 [2025-04-13 23:32:59,353 INFO L226 Difference]: Without dead ends: 12573 [2025-04-13 23:32:59,357 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 23:32:59,358 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 277 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:59,358 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 132 Invalid, 1712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1688 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:32:59,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12573 states. [2025-04-13 23:32:59,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12573 to 6495. [2025-04-13 23:32:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6495 states, 6494 states have (on average 3.666923313828149) internal successors, (23813), 6494 states have internal predecessors, (23813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:32:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6495 states to 6495 states and 23813 transitions. [2025-04-13 23:32:59,525 INFO L79 Accepts]: Start accepts. Automaton has 6495 states and 23813 transitions. Word has length 54 [2025-04-13 23:32:59,525 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:59,525 INFO L485 AbstractCegarLoop]: Abstraction has 6495 states and 23813 transitions. [2025-04-13 23:32:59,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 23:32:59,525 INFO L278 IsEmpty]: Start isEmpty. Operand 6495 states and 23813 transitions. [2025-04-13 23:32:59,536 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:32:59,536 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:59,536 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:59,536 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable340 [2025-04-13 23:32:59,536 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 23:32:59,536 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:59,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1997922951, now seen corresponding path program 342 times [2025-04-13 23:32:59,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:59,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102569217] [2025-04-13 23:32:59,536 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:32:59,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:59,539 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:32:59,549 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:32:59,549 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:32:59,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:00,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:00,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102569217] [2025-04-13 23:33:00,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102569217] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:00,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:00,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:00,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967732857] [2025-04-13 23:33:00,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:00,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:00,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:00,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:00,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:00,176 INFO L87 Difference]: Start difference. First operand 6495 states and 23813 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:01,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:01,219 INFO L93 Difference]: Finished difference Result 11516 states and 40862 transitions. [2025-04-13 23:33:01,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:01,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 23:33:01,219 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:01,272 INFO L225 Difference]: With dead ends: 11516 [2025-04-13 23:33:01,272 INFO L226 Difference]: Without dead ends: 11448 [2025-04-13 23:33:01,276 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 23:33:01,277 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 277 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:01,277 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 130 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:33:01,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11448 states. [2025-04-13 23:33:01,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11448 to 6525. [2025-04-13 23:33:01,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6525 states, 6524 states have (on average 3.6646229307173512) internal successors, (23908), 6524 states have internal predecessors, (23908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:01,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6525 states to 6525 states and 23908 transitions. [2025-04-13 23:33:01,446 INFO L79 Accepts]: Start accepts. Automaton has 6525 states and 23908 transitions. Word has length 54 [2025-04-13 23:33:01,447 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:01,447 INFO L485 AbstractCegarLoop]: Abstraction has 6525 states and 23908 transitions. [2025-04-13 23:33:01,447 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:01,447 INFO L278 IsEmpty]: Start isEmpty. Operand 6525 states and 23908 transitions. [2025-04-13 23:33:01,457 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:01,457 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:01,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 23:33:01,457 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable341 [2025-04-13 23:33:01,457 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 23:33:01,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:01,458 INFO L85 PathProgramCache]: Analyzing trace with hash 813001175, now seen corresponding path program 343 times [2025-04-13 23:33:01,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:01,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97010534] [2025-04-13 23:33:01,458 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:33:01,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:01,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:01,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:01,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:33:01,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:02,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:02,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:02,059 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97010534] [2025-04-13 23:33:02,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97010534] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:02,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:02,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:02,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257860274] [2025-04-13 23:33:02,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:02,059 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:02,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:02,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:02,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:02,059 INFO L87 Difference]: Start difference. First operand 6525 states and 23908 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:03,003 INFO L93 Difference]: Finished difference Result 12746 states and 45299 transitions. [2025-04-13 23:33:03,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:03,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 23:33:03,003 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:03,060 INFO L225 Difference]: With dead ends: 12746 [2025-04-13 23:33:03,060 INFO L226 Difference]: Without dead ends: 12675 [2025-04-13 23:33:03,065 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 23:33:03,065 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 284 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:03,065 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 124 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1620 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:33:03,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12675 states. [2025-04-13 23:33:03,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12675 to 6533. [2025-04-13 23:33:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6533 states, 6532 states have (on average 3.66319657072872) internal successors, (23928), 6532 states have internal predecessors, (23928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:03,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6533 states to 6533 states and 23928 transitions. [2025-04-13 23:33:03,236 INFO L79 Accepts]: Start accepts. Automaton has 6533 states and 23928 transitions. Word has length 54 [2025-04-13 23:33:03,236 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:03,237 INFO L485 AbstractCegarLoop]: Abstraction has 6533 states and 23928 transitions. [2025-04-13 23:33:03,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:03,237 INFO L278 IsEmpty]: Start isEmpty. Operand 6533 states and 23928 transitions. [2025-04-13 23:33:03,247 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:03,247 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:03,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:03,247 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable342 [2025-04-13 23:33:03,247 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 23:33:03,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:03,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1227444969, now seen corresponding path program 344 times [2025-04-13 23:33:03,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:03,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263782799] [2025-04-13 23:33:03,248 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:33:03,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:03,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:03,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:03,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:33:03,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:03,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:03,905 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263782799] [2025-04-13 23:33:03,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263782799] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:03,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:03,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:03,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260708361] [2025-04-13 23:33:03,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:03,906 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:03,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:03,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:03,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:03,906 INFO L87 Difference]: Start difference. First operand 6533 states and 23928 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:04,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:04,918 INFO L93 Difference]: Finished difference Result 11526 states and 40877 transitions. [2025-04-13 23:33:04,918 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:04,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 23:33:04,918 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:04,968 INFO L225 Difference]: With dead ends: 11526 [2025-04-13 23:33:04,968 INFO L226 Difference]: Without dead ends: 11446 [2025-04-13 23:33:04,972 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 23:33:04,972 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 261 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:04,973 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 132 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:33:04,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11446 states. [2025-04-13 23:33:05,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11446 to 6523. [2025-04-13 23:33:05,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6523 states, 6522 states have (on average 3.663446795461515) internal successors, (23893), 6522 states have internal predecessors, (23893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6523 states to 6523 states and 23893 transitions. [2025-04-13 23:33:05,203 INFO L79 Accepts]: Start accepts. Automaton has 6523 states and 23893 transitions. Word has length 54 [2025-04-13 23:33:05,203 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:05,203 INFO L485 AbstractCegarLoop]: Abstraction has 6523 states and 23893 transitions. [2025-04-13 23:33:05,203 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:05,203 INFO L278 IsEmpty]: Start isEmpty. Operand 6523 states and 23893 transitions. [2025-04-13 23:33:05,214 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:05,214 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:05,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:05,214 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable343 [2025-04-13 23:33:05,214 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 23:33:05,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:05,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1080442913, now seen corresponding path program 345 times [2025-04-13 23:33:05,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:05,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052007592] [2025-04-13 23:33:05,215 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:33:05,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:05,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:05,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:05,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:33:05,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:05,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 23:33:05,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:05,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052007592] [2025-04-13 23:33:05,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052007592] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:05,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:05,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:05,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801650482] [2025-04-13 23:33:05,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:05,794 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:05,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:05,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:05,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:05,794 INFO L87 Difference]: Start difference. First operand 6523 states and 23893 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:06,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:06,695 INFO L93 Difference]: Finished difference Result 12665 states and 45076 transitions. [2025-04-13 23:33:06,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:06,695 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:06,695 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:06,746 INFO L225 Difference]: With dead ends: 12665 [2025-04-13 23:33:06,747 INFO L226 Difference]: Without dead ends: 12577 [2025-04-13 23:33:06,751 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 23:33:06,751 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 318 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:06,752 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 123 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:33:06,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12577 states. [2025-04-13 23:33:06,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12577 to 6499. [2025-04-13 23:33:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6499 states, 6498 states have (on average 3.6665127731609726) internal successors, (23825), 6498 states have internal predecessors, (23825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:06,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6499 states to 6499 states and 23825 transitions. [2025-04-13 23:33:06,926 INFO L79 Accepts]: Start accepts. Automaton has 6499 states and 23825 transitions. Word has length 54 [2025-04-13 23:33:06,926 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:06,926 INFO L485 AbstractCegarLoop]: Abstraction has 6499 states and 23825 transitions. [2025-04-13 23:33:06,926 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:06,926 INFO L278 IsEmpty]: Start isEmpty. Operand 6499 states and 23825 transitions. [2025-04-13 23:33:06,936 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:06,937 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:06,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:06,937 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable344 [2025-04-13 23:33:06,937 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 23:33:06,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:06,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1459207145, now seen corresponding path program 346 times [2025-04-13 23:33:06,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:06,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565264836] [2025-04-13 23:33:06,937 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:33:06,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:06,940 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:33:06,950 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 23:33:06,951 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:33:06,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:07,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:07,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:07,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565264836] [2025-04-13 23:33:07,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565264836] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:07,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:07,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:07,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140666573] [2025-04-13 23:33:07,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:07,526 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:07,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:07,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:07,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:07,527 INFO L87 Difference]: Start difference. First operand 6499 states and 23825 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:08,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:08,438 INFO L93 Difference]: Finished difference Result 11466 states and 40726 transitions. [2025-04-13 23:33:08,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:08,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 23:33:08,439 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:08,488 INFO L225 Difference]: With dead ends: 11466 [2025-04-13 23:33:08,488 INFO L226 Difference]: Without dead ends: 11332 [2025-04-13 23:33:08,493 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 23:33:08,493 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 267 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1648 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:08,493 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 126 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1648 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:33:08,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11332 states. [2025-04-13 23:33:08,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11332 to 6479. [2025-04-13 23:33:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6479 states, 6478 states have (on average 3.6670268601420193) internal successors, (23755), 6478 states have internal predecessors, (23755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:08,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6479 states to 6479 states and 23755 transitions. [2025-04-13 23:33:08,648 INFO L79 Accepts]: Start accepts. Automaton has 6479 states and 23755 transitions. Word has length 54 [2025-04-13 23:33:08,648 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:08,649 INFO L485 AbstractCegarLoop]: Abstraction has 6479 states and 23755 transitions. [2025-04-13 23:33:08,649 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:08,649 INFO L278 IsEmpty]: Start isEmpty. Operand 6479 states and 23755 transitions. [2025-04-13 23:33:08,659 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:08,659 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:08,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:08,659 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable345 [2025-04-13 23:33:08,659 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 23:33:08,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:08,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2032134747, now seen corresponding path program 347 times [2025-04-13 23:33:08,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:08,659 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920751697] [2025-04-13 23:33:08,659 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:33:08,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:08,662 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:08,672 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:08,672 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:33:08,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:09,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 23:33:09,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:09,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920751697] [2025-04-13 23:33:09,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920751697] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:09,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:09,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:09,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65729375] [2025-04-13 23:33:09,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:09,268 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:09,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:09,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:09,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:09,268 INFO L87 Difference]: Start difference. First operand 6479 states and 23755 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:10,142 INFO L93 Difference]: Finished difference Result 12800 states and 45450 transitions. [2025-04-13 23:33:10,143 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:10,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 23:33:10,143 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:10,198 INFO L225 Difference]: With dead ends: 12800 [2025-04-13 23:33:10,198 INFO L226 Difference]: Without dead ends: 12683 [2025-04-13 23:33:10,203 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 23:33:10,203 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 302 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 116 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 23:33:10,203 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 116 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:33:10,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12683 states. [2025-04-13 23:33:10,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12683 to 6501. [2025-04-13 23:33:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6501 states, 6500 states have (on average 3.662923076923077) internal successors, (23809), 6500 states have internal predecessors, (23809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6501 states to 6501 states and 23809 transitions. [2025-04-13 23:33:10,378 INFO L79 Accepts]: Start accepts. Automaton has 6501 states and 23809 transitions. Word has length 54 [2025-04-13 23:33:10,378 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:10,378 INFO L485 AbstractCegarLoop]: Abstraction has 6501 states and 23809 transitions. [2025-04-13 23:33:10,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 23:33:10,378 INFO L278 IsEmpty]: Start isEmpty. Operand 6501 states and 23809 transitions. [2025-04-13 23:33:10,391 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:10,391 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:10,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:10,391 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable346 [2025-04-13 23:33:10,391 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 23:33:10,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:10,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1999530631, now seen corresponding path program 348 times [2025-04-13 23:33:10,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:10,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240883516] [2025-04-13 23:33:10,391 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:33:10,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:10,394 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:10,405 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:10,405 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:33:10,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:11,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:11,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240883516] [2025-04-13 23:33:11,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240883516] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:11,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:11,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:11,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735671699] [2025-04-13 23:33:11,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:11,030 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:11,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:11,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:11,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:11,030 INFO L87 Difference]: Start difference. First operand 6501 states and 23809 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:12,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:12,088 INFO L93 Difference]: Finished difference Result 11358 states and 40385 transitions. [2025-04-13 23:33:12,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:12,089 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:12,089 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:12,179 INFO L225 Difference]: With dead ends: 11358 [2025-04-13 23:33:12,179 INFO L226 Difference]: Without dead ends: 11287 [2025-04-13 23:33:12,180 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:33:12,180 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 279 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 1612 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:12,180 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 120 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1612 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:33:12,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11287 states. [2025-04-13 23:33:12,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11287 to 6534. [2025-04-13 23:33:12,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6534 states, 6533 states have (on average 3.660186744221644) internal successors, (23912), 6533 states have internal predecessors, (23912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:12,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6534 states to 6534 states and 23912 transitions. [2025-04-13 23:33:12,306 INFO L79 Accepts]: Start accepts. Automaton has 6534 states and 23912 transitions. Word has length 54 [2025-04-13 23:33:12,307 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:12,307 INFO L485 AbstractCegarLoop]: Abstraction has 6534 states and 23912 transitions. [2025-04-13 23:33:12,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:12,307 INFO L278 IsEmpty]: Start isEmpty. Operand 6534 states and 23912 transitions. [2025-04-13 23:33:12,317 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:12,317 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:12,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:12,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable347 [2025-04-13 23:33:12,317 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 23:33:12,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:12,318 INFO L85 PathProgramCache]: Analyzing trace with hash 574118103, now seen corresponding path program 349 times [2025-04-13 23:33:12,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:12,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265162423] [2025-04-13 23:33:12,318 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:33:12,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:12,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:12,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:12,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:33:12,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:12,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:12,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265162423] [2025-04-13 23:33:12,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265162423] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:12,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:12,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:12,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834607052] [2025-04-13 23:33:12,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:12,933 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:12,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:12,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:12,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:12,934 INFO L87 Difference]: Start difference. First operand 6534 states and 23912 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:13,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:13,850 INFO L93 Difference]: Finished difference Result 12797 states and 45433 transitions. [2025-04-13 23:33:13,850 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:13,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 23:33:13,851 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:13,910 INFO L225 Difference]: With dead ends: 12797 [2025-04-13 23:33:13,910 INFO L226 Difference]: Without dead ends: 12726 [2025-04-13 23:33:13,915 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 23:33:13,916 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 327 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:13,916 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 115 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:33:13,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12726 states. [2025-04-13 23:33:14,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12726 to 6534. [2025-04-13 23:33:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6534 states, 6533 states have (on average 3.660186744221644) internal successors, (23912), 6533 states have internal predecessors, (23912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6534 states to 6534 states and 23912 transitions. [2025-04-13 23:33:14,091 INFO L79 Accepts]: Start accepts. Automaton has 6534 states and 23912 transitions. Word has length 54 [2025-04-13 23:33:14,092 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:14,092 INFO L485 AbstractCegarLoop]: Abstraction has 6534 states and 23912 transitions. [2025-04-13 23:33:14,092 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:14,092 INFO L278 IsEmpty]: Start isEmpty. Operand 6534 states and 23912 transitions. [2025-04-13 23:33:14,102 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:14,102 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:14,102 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:14,102 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable348 [2025-04-13 23:33:14,102 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 23:33:14,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:14,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1059395305, now seen corresponding path program 350 times [2025-04-13 23:33:14,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:14,102 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570186160] [2025-04-13 23:33:14,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:33:14,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:14,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:14,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:14,116 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:33:14,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:14,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 23:33:14,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:14,750 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570186160] [2025-04-13 23:33:14,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570186160] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:14,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:14,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:14,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215652329] [2025-04-13 23:33:14,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:14,750 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:14,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:14,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:14,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:14,751 INFO L87 Difference]: Start difference. First operand 6534 states and 23912 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:15,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:15,698 INFO L93 Difference]: Finished difference Result 11368 states and 40399 transitions. [2025-04-13 23:33:15,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:15,698 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:15,698 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:15,749 INFO L225 Difference]: With dead ends: 11368 [2025-04-13 23:33:15,749 INFO L226 Difference]: Without dead ends: 11287 [2025-04-13 23:33:15,753 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=406, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:33:15,753 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 268 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:15,753 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 116 Invalid, 1528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:33:15,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11287 states. [2025-04-13 23:33:15,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11287 to 6534. [2025-04-13 23:33:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6534 states, 6533 states have (on average 3.6585029848461654) internal successors, (23901), 6533 states have internal predecessors, (23901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:15,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6534 states to 6534 states and 23901 transitions. [2025-04-13 23:33:15,916 INFO L79 Accepts]: Start accepts. Automaton has 6534 states and 23901 transitions. Word has length 54 [2025-04-13 23:33:15,917 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:15,917 INFO L485 AbstractCegarLoop]: Abstraction has 6534 states and 23901 transitions. [2025-04-13 23:33:15,917 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:15,917 INFO L278 IsEmpty]: Start isEmpty. Operand 6534 states and 23901 transitions. [2025-04-13 23:33:15,927 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:15,927 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:15,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:15,927 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable349 [2025-04-13 23:33:15,927 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 23:33:15,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:15,928 INFO L85 PathProgramCache]: Analyzing trace with hash -960711869, now seen corresponding path program 351 times [2025-04-13 23:33:15,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:15,928 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469746979] [2025-04-13 23:33:15,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:33:15,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:15,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:15,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:15,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:33:15,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:16,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:16,564 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469746979] [2025-04-13 23:33:16,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469746979] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:16,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:16,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:16,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351226291] [2025-04-13 23:33:16,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:16,564 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:16,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:16,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:16,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:16,564 INFO L87 Difference]: Start difference. First operand 6534 states and 23901 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:17,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:17,494 INFO L93 Difference]: Finished difference Result 12715 states and 45204 transitions. [2025-04-13 23:33:17,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:17,495 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:17,495 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:17,552 INFO L225 Difference]: With dead ends: 12715 [2025-04-13 23:33:17,552 INFO L226 Difference]: Without dead ends: 12612 [2025-04-13 23:33:17,557 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 23:33:17,558 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 267 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:17,558 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 132 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:33:17,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12612 states. [2025-04-13 23:33:17,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12612 to 6501. [2025-04-13 23:33:17,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6501 states, 6500 states have (on average 3.6633846153846155) internal successors, (23812), 6500 states have internal predecessors, (23812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6501 states to 6501 states and 23812 transitions. [2025-04-13 23:33:17,744 INFO L79 Accepts]: Start accepts. Automaton has 6501 states and 23812 transitions. Word has length 54 [2025-04-13 23:33:17,745 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:17,745 INFO L485 AbstractCegarLoop]: Abstraction has 6501 states and 23812 transitions. [2025-04-13 23:33:17,745 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:17,745 INFO L278 IsEmpty]: Start isEmpty. Operand 6501 states and 23812 transitions. [2025-04-13 23:33:17,755 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:17,755 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:17,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:17,755 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable350 [2025-04-13 23:33:17,755 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 23:33:17,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:17,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1622005257, now seen corresponding path program 352 times [2025-04-13 23:33:17,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:17,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376671058] [2025-04-13 23:33:17,756 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:33:17,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:17,758 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:33:17,769 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 23:33:17,769 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:33:17,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:18,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:18,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:18,374 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376671058] [2025-04-13 23:33:18,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376671058] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:18,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:18,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 23:33:18,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210964826] [2025-04-13 23:33:18,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:18,374 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:33:18,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:18,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:33:18,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:33:18,374 INFO L87 Difference]: Start difference. First operand 6501 states and 23812 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:19,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:19,377 INFO L93 Difference]: Finished difference Result 12868 states and 45288 transitions. [2025-04-13 23:33:19,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 23:33:19,377 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:19,377 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:19,429 INFO L225 Difference]: With dead ends: 12868 [2025-04-13 23:33:19,429 INFO L226 Difference]: Without dead ends: 12722 [2025-04-13 23:33:19,434 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=555, Unknown=0, NotChecked=0, Total=812 [2025-04-13 23:33:19,434 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 318 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:19,434 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 133 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1747 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:33:19,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12722 states. [2025-04-13 23:33:19,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12722 to 6469. [2025-04-13 23:33:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6469 states, 6468 states have (on average 3.666048237476809) internal successors, (23712), 6468 states have internal predecessors, (23712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:19,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6469 states to 6469 states and 23712 transitions. [2025-04-13 23:33:19,601 INFO L79 Accepts]: Start accepts. Automaton has 6469 states and 23712 transitions. Word has length 54 [2025-04-13 23:33:19,601 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:19,601 INFO L485 AbstractCegarLoop]: Abstraction has 6469 states and 23712 transitions. [2025-04-13 23:33:19,601 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:19,601 INFO L278 IsEmpty]: Start isEmpty. Operand 6469 states and 23712 transitions. [2025-04-13 23:33:19,611 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:19,611 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:19,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 23:33:19,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable351 [2025-04-13 23:33:19,611 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 23:33:19,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:19,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1581741529, now seen corresponding path program 353 times [2025-04-13 23:33:19,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:19,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637035210] [2025-04-13 23:33:19,612 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:33:19,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:19,614 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:19,624 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:19,624 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:33:19,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:20,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 23:33:20,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:20,240 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637035210] [2025-04-13 23:33:20,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637035210] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:20,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:20,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:20,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933818703] [2025-04-13 23:33:20,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:20,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:20,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:20,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:20,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:20,240 INFO L87 Difference]: Start difference. First operand 6469 states and 23712 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:21,108 INFO L93 Difference]: Finished difference Result 12806 states and 45430 transitions. [2025-04-13 23:33:21,108 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:21,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 23:33:21,108 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:21,169 INFO L225 Difference]: With dead ends: 12806 [2025-04-13 23:33:21,169 INFO L226 Difference]: Without dead ends: 12735 [2025-04-13 23:33:21,174 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 23:33:21,174 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 346 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:21,174 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 115 Invalid, 1552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:33:21,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12735 states. [2025-04-13 23:33:21,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12735 to 6481. [2025-04-13 23:33:21,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6481 states, 6480 states have (on average 3.664814814814815) internal successors, (23748), 6480 states have internal predecessors, (23748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6481 states to 6481 states and 23748 transitions. [2025-04-13 23:33:21,375 INFO L79 Accepts]: Start accepts. Automaton has 6481 states and 23748 transitions. Word has length 54 [2025-04-13 23:33:21,375 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:21,375 INFO L485 AbstractCegarLoop]: Abstraction has 6481 states and 23748 transitions. [2025-04-13 23:33:21,375 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:21,375 INFO L278 IsEmpty]: Start isEmpty. Operand 6481 states and 23748 transitions. [2025-04-13 23:33:21,385 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:21,385 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:21,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:21,385 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable352 [2025-04-13 23:33:21,386 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 23:33:21,386 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:21,386 INFO L85 PathProgramCache]: Analyzing trace with hash 932820087, now seen corresponding path program 354 times [2025-04-13 23:33:21,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:21,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236399984] [2025-04-13 23:33:21,386 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:33:21,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:21,389 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:21,399 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:21,399 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:33:21,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:22,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:22,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:22,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236399984] [2025-04-13 23:33:22,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236399984] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:22,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:22,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:22,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588679245] [2025-04-13 23:33:22,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:22,075 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:22,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:22,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:22,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:22,076 INFO L87 Difference]: Start difference. First operand 6481 states and 23748 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:22,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:22,986 INFO L93 Difference]: Finished difference Result 11168 states and 39825 transitions. [2025-04-13 23:33:22,987 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:33:22,987 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:22,987 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:23,041 INFO L225 Difference]: With dead ends: 11168 [2025-04-13 23:33:23,042 INFO L226 Difference]: Without dead ends: 11060 [2025-04-13 23:33:23,046 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:33:23,046 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 264 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:23,046 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 110 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:33:23,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11060 states. [2025-04-13 23:33:23,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11060 to 6541. [2025-04-13 23:33:23,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6541 states, 6540 states have (on average 3.660244648318043) internal successors, (23938), 6540 states have internal predecessors, (23938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:23,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6541 states to 6541 states and 23938 transitions. [2025-04-13 23:33:23,278 INFO L79 Accepts]: Start accepts. Automaton has 6541 states and 23938 transitions. Word has length 54 [2025-04-13 23:33:23,278 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:23,278 INFO L485 AbstractCegarLoop]: Abstraction has 6541 states and 23938 transitions. [2025-04-13 23:33:23,278 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:23,279 INFO L278 IsEmpty]: Start isEmpty. Operand 6541 states and 23938 transitions. [2025-04-13 23:33:23,288 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:23,289 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33: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 23:33:23,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable353 [2025-04-13 23:33:23,289 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 23:33:23,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:23,290 INFO L85 PathProgramCache]: Analyzing trace with hash -829591519, now seen corresponding path program 355 times [2025-04-13 23:33:23,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:23,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065543753] [2025-04-13 23:33:23,290 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:33:23,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:23,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:23,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:23,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:33:23,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:23,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:23,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065543753] [2025-04-13 23:33:23,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065543753] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:23,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:23,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:23,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448945855] [2025-04-13 23:33:23,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:23,891 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:23,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:23,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:23,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:23,891 INFO L87 Difference]: Start difference. First operand 6541 states and 23938 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:24,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:24,822 INFO L93 Difference]: Finished difference Result 12859 states and 45593 transitions. [2025-04-13 23:33:24,822 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:24,822 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:24,822 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:24,877 INFO L225 Difference]: With dead ends: 12859 [2025-04-13 23:33:24,878 INFO L226 Difference]: Without dead ends: 12787 [2025-04-13 23:33:24,882 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 23:33:24,882 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 311 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 1765 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:24,882 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 137 Invalid, 1787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1765 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:33:24,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12787 states. [2025-04-13 23:33:24,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12787 to 6533. [2025-04-13 23:33:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6533 states, 6532 states have (on average 3.661053276178812) internal successors, (23914), 6532 states have internal predecessors, (23914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6533 states to 6533 states and 23914 transitions. [2025-04-13 23:33:25,050 INFO L79 Accepts]: Start accepts. Automaton has 6533 states and 23914 transitions. Word has length 54 [2025-04-13 23:33:25,051 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:25,051 INFO L485 AbstractCegarLoop]: Abstraction has 6533 states and 23914 transitions. [2025-04-13 23:33:25,051 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:25,051 INFO L278 IsEmpty]: Start isEmpty. Operand 6533 states and 23914 transitions. [2025-04-13 23:33:25,061 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:25,061 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:25,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 23:33:25,061 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable354 [2025-04-13 23:33:25,061 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 23:33:25,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:25,062 INFO L85 PathProgramCache]: Analyzing trace with hash 462162965, now seen corresponding path program 356 times [2025-04-13 23:33:25,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:25,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103442853] [2025-04-13 23:33:25,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:33:25,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:25,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:25,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:25,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:33:25,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:25,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 23:33:25,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:25,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103442853] [2025-04-13 23:33:25,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103442853] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:25,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:25,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:25,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317960953] [2025-04-13 23:33:25,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:25,692 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:25,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:25,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:25,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:25,692 INFO L87 Difference]: Start difference. First operand 6533 states and 23914 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:26,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:26,604 INFO L93 Difference]: Finished difference Result 11200 states and 39874 transitions. [2025-04-13 23:33:26,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:26,604 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:26,604 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:26,654 INFO L225 Difference]: With dead ends: 11200 [2025-04-13 23:33:26,654 INFO L226 Difference]: Without dead ends: 11132 [2025-04-13 23:33:26,658 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:33:26,658 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 301 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:26,658 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 95 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:33:26,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11132 states. [2025-04-13 23:33:26,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11132 to 6543. [2025-04-13 23:33:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6543 states, 6542 states have (on average 3.659278508101498) internal successors, (23939), 6542 states have internal predecessors, (23939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:26,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6543 states to 6543 states and 23939 transitions. [2025-04-13 23:33:26,827 INFO L79 Accepts]: Start accepts. Automaton has 6543 states and 23939 transitions. Word has length 54 [2025-04-13 23:33:26,827 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:26,827 INFO L485 AbstractCegarLoop]: Abstraction has 6543 states and 23939 transitions. [2025-04-13 23:33:26,827 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:26,827 INFO L278 IsEmpty]: Start isEmpty. Operand 6543 states and 23939 transitions. [2025-04-13 23:33:26,838 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:26,838 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:26,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:26,838 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable355 [2025-04-13 23:33:26,839 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 23:33:26,839 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:26,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1418943417, now seen corresponding path program 357 times [2025-04-13 23:33:26,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:26,839 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950536724] [2025-04-13 23:33:26,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:33:26,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:26,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:26,852 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:26,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:33:26,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:27,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:27,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:27,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950536724] [2025-04-13 23:33:27,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950536724] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:27,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:27,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:27,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586090177] [2025-04-13 23:33:27,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:27,452 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:27,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:27,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:27,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:27,452 INFO L87 Difference]: Start difference. First operand 6543 states and 23939 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:28,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:28,346 INFO L93 Difference]: Finished difference Result 12878 states and 45649 transitions. [2025-04-13 23:33:28,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:28,346 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:28,346 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:28,408 INFO L225 Difference]: With dead ends: 12878 [2025-04-13 23:33:28,408 INFO L226 Difference]: Without dead ends: 12807 [2025-04-13 23:33:28,414 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:33:28,414 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 328 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 1560 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:28,414 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 117 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1560 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:33:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12807 states. [2025-04-13 23:33:28,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12807 to 6554. [2025-04-13 23:33:28,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6554 states, 6553 states have (on average 3.657256218525866) internal successors, (23966), 6553 states have internal predecessors, (23966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:28,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6554 states to 6554 states and 23966 transitions. [2025-04-13 23:33:28,606 INFO L79 Accepts]: Start accepts. Automaton has 6554 states and 23966 transitions. Word has length 54 [2025-04-13 23:33:28,606 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:28,606 INFO L485 AbstractCegarLoop]: Abstraction has 6554 states and 23966 transitions. [2025-04-13 23:33:28,606 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:28,606 INFO L278 IsEmpty]: Start isEmpty. Operand 6554 states and 23966 transitions. [2025-04-13 23:33:28,617 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:28,617 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:28,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 23:33:28,617 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable356 [2025-04-13 23:33:28,617 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 23:33:28,617 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:28,617 INFO L85 PathProgramCache]: Analyzing trace with hash -308315017, now seen corresponding path program 358 times [2025-04-13 23:33:28,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:28,618 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696736113] [2025-04-13 23:33:28,618 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:33:28,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:28,620 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:33:28,634 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 23:33:28,634 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:33:28,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:29,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 23:33:29,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:29,185 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696736113] [2025-04-13 23:33:29,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696736113] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:29,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:29,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:29,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717225421] [2025-04-13 23:33:29,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:29,186 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:29,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:29,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:29,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:29,186 INFO L87 Difference]: Start difference. First operand 6554 states and 23966 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:30,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:30,045 INFO L93 Difference]: Finished difference Result 11143 states and 39718 transitions. [2025-04-13 23:33:30,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:33:30,045 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:30,045 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:30,107 INFO L225 Difference]: With dead ends: 11143 [2025-04-13 23:33:30,108 INFO L226 Difference]: Without dead ends: 11043 [2025-04-13 23:33:30,112 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:33:30,112 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 250 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:30,112 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 105 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:33:30,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11043 states. [2025-04-13 23:33:30,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11043 to 6524. [2025-04-13 23:33:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6524 states, 6523 states have (on average 3.6595124942511115) internal successors, (23871), 6523 states have internal predecessors, (23871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6524 states to 6524 states and 23871 transitions. [2025-04-13 23:33:30,304 INFO L79 Accepts]: Start accepts. Automaton has 6524 states and 23871 transitions. Word has length 54 [2025-04-13 23:33:30,304 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:30,304 INFO L485 AbstractCegarLoop]: Abstraction has 6524 states and 23871 transitions. [2025-04-13 23:33:30,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:30,304 INFO L278 IsEmpty]: Start isEmpty. Operand 6524 states and 23871 transitions. [2025-04-13 23:33:30,314 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:30,314 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:30,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:30,315 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable357 [2025-04-13 23:33:30,315 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 23:33:30,315 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:30,315 INFO L85 PathProgramCache]: Analyzing trace with hash -90377277, now seen corresponding path program 359 times [2025-04-13 23:33:30,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:30,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100837821] [2025-04-13 23:33:30,316 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:33:30,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:30,318 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:30,328 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:30,328 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:33:30,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:30,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:30,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:30,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100837821] [2025-04-13 23:33:30,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100837821] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:30,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:30,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:30,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097382184] [2025-04-13 23:33:30,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:30,902 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:30,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:30,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:30,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:30,902 INFO L87 Difference]: Start difference. First operand 6524 states and 23871 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:31,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:31,771 INFO L93 Difference]: Finished difference Result 12799 states and 45428 transitions. [2025-04-13 23:33:31,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:31,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 23:33:31,771 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:31,830 INFO L225 Difference]: With dead ends: 12799 [2025-04-13 23:33:31,830 INFO L226 Difference]: Without dead ends: 12718 [2025-04-13 23:33:31,835 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 23:33:31,835 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 326 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1526 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:31,836 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 115 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:33:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12718 states. [2025-04-13 23:33:31,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12718 to 6513. [2025-04-13 23:33:31,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6513 states, 6512 states have (on average 3.660933660933661) internal successors, (23840), 6512 states have internal predecessors, (23840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6513 states to 6513 states and 23840 transitions. [2025-04-13 23:33:32,013 INFO L79 Accepts]: Start accepts. Automaton has 6513 states and 23840 transitions. Word has length 54 [2025-04-13 23:33:32,013 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:32,013 INFO L485 AbstractCegarLoop]: Abstraction has 6513 states and 23840 transitions. [2025-04-13 23:33:32,013 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:32,013 INFO L278 IsEmpty]: Start isEmpty. Operand 6513 states and 23840 transitions. [2025-04-13 23:33:32,025 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:32,025 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:32,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 23:33:32,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable358 [2025-04-13 23:33:32,025 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 23:33:32,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:32,026 INFO L85 PathProgramCache]: Analyzing trace with hash 380763909, now seen corresponding path program 360 times [2025-04-13 23:33:32,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:32,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403459053] [2025-04-13 23:33:32,026 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:33:32,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:32,029 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:32,041 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:32,041 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:33:32,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:32,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:32,662 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403459053] [2025-04-13 23:33:32,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403459053] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:32,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:32,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:32,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477781164] [2025-04-13 23:33:32,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:32,662 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:32,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:32,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:32,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:32,663 INFO L87 Difference]: Start difference. First operand 6513 states and 23840 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:33,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:33,625 INFO L93 Difference]: Finished difference Result 11144 states and 39727 transitions. [2025-04-13 23:33:33,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:33,625 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:33,625 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:33,676 INFO L225 Difference]: With dead ends: 11144 [2025-04-13 23:33:33,676 INFO L226 Difference]: Without dead ends: 11076 [2025-04-13 23:33:33,680 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:33:33,680 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 263 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:33,680 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 109 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:33:33,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11076 states. [2025-04-13 23:33:33,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11076 to 6543. [2025-04-13 23:33:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6543 states, 6542 states have (on average 3.658667074289208) internal successors, (23935), 6542 states have internal predecessors, (23935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6543 states to 6543 states and 23935 transitions. [2025-04-13 23:33:33,839 INFO L79 Accepts]: Start accepts. Automaton has 6543 states and 23935 transitions. Word has length 54 [2025-04-13 23:33:33,839 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:33,839 INFO L485 AbstractCegarLoop]: Abstraction has 6543 states and 23935 transitions. [2025-04-13 23:33:33,840 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:33,840 INFO L278 IsEmpty]: Start isEmpty. Operand 6543 states and 23935 transitions. [2025-04-13 23:33:33,850 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:33,850 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:33,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 23:33:33,850 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable359 [2025-04-13 23:33:33,850 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 23:33:33,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:33,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2131548223, now seen corresponding path program 361 times [2025-04-13 23:33:33,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:33,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56948454] [2025-04-13 23:33:33,850 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:33:33,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:33,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:33,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:33,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:33:33,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:34,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:34,480 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56948454] [2025-04-13 23:33:34,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56948454] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:34,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:34,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:34,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054989273] [2025-04-13 23:33:34,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:34,480 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:34,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:34,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:34,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:34,480 INFO L87 Difference]: Start difference. First operand 6543 states and 23935 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:35,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:35,449 INFO L93 Difference]: Finished difference Result 12774 states and 45362 transitions. [2025-04-13 23:33:35,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:35,449 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:35,449 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:35,509 INFO L225 Difference]: With dead ends: 12774 [2025-04-13 23:33:35,509 INFO L226 Difference]: Without dead ends: 12710 [2025-04-13 23:33:35,514 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 23:33:35,515 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 272 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:35,515 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 144 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1818 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:33:35,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12710 states. [2025-04-13 23:33:35,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12710 to 6551. [2025-04-13 23:33:35,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6551 states, 6550 states have (on average 3.6572519083969466) internal successors, (23955), 6550 states have internal predecessors, (23955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6551 states to 6551 states and 23955 transitions. [2025-04-13 23:33:35,700 INFO L79 Accepts]: Start accepts. Automaton has 6551 states and 23955 transitions. Word has length 54 [2025-04-13 23:33:35,700 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:35,700 INFO L485 AbstractCegarLoop]: Abstraction has 6551 states and 23955 transitions. [2025-04-13 23:33:35,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 23:33:35,700 INFO L278 IsEmpty]: Start isEmpty. Operand 6551 states and 23955 transitions. [2025-04-13 23:33:35,711 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:35,711 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:35,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 23:33:35,711 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable360 [2025-04-13 23:33:35,711 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 23:33:35,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:35,712 INFO L85 PathProgramCache]: Analyzing trace with hash -389714073, now seen corresponding path program 362 times [2025-04-13 23:33:35,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:35,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831038017] [2025-04-13 23:33:35,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:33:35,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:35,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:35,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:35,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:33:35,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:36,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:36,337 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831038017] [2025-04-13 23:33:36,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831038017] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:36,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:36,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:36,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505314437] [2025-04-13 23:33:36,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:36,338 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:36,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:36,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:36,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:36,338 INFO L87 Difference]: Start difference. First operand 6551 states and 23955 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:37,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:37,246 INFO L93 Difference]: Finished difference Result 11154 states and 39742 transitions. [2025-04-13 23:33:37,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:37,247 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:37,247 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:37,301 INFO L225 Difference]: With dead ends: 11154 [2025-04-13 23:33:37,301 INFO L226 Difference]: Without dead ends: 11074 [2025-04-13 23:33:37,305 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:33:37,305 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 275 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:37,305 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 105 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:33:37,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11074 states. [2025-04-13 23:33:37,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11074 to 6541. [2025-04-13 23:33:37,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6541 states, 6540 states have (on average 3.6574923547400613) internal successors, (23920), 6540 states have internal predecessors, (23920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6541 states to 6541 states and 23920 transitions. [2025-04-13 23:33:37,465 INFO L79 Accepts]: Start accepts. Automaton has 6541 states and 23920 transitions. Word has length 54 [2025-04-13 23:33:37,465 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:37,465 INFO L485 AbstractCegarLoop]: Abstraction has 6541 states and 23920 transitions. [2025-04-13 23:33:37,465 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:37,465 INFO L278 IsEmpty]: Start isEmpty. Operand 6541 states and 23920 transitions. [2025-04-13 23:33:37,476 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:37,476 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:37,476 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:37,476 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable361 [2025-04-13 23:33:37,476 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 23:33:37,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:37,476 INFO L85 PathProgramCache]: Analyzing trace with hash -2136799775, now seen corresponding path program 363 times [2025-04-13 23:33:37,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:37,476 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524096565] [2025-04-13 23:33:37,477 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:33:37,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:37,479 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:37,490 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:37,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:33:37,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:38,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:38,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:38,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524096565] [2025-04-13 23:33:38,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524096565] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:38,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:38,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:38,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116921639] [2025-04-13 23:33:38,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:38,113 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:38,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:38,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:38,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:38,114 INFO L87 Difference]: Start difference. First operand 6541 states and 23920 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:38,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:38,994 INFO L93 Difference]: Finished difference Result 12722 states and 45223 transitions. [2025-04-13 23:33:38,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:38,994 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:38,994 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:39,053 INFO L225 Difference]: With dead ends: 12722 [2025-04-13 23:33:39,053 INFO L226 Difference]: Without dead ends: 12632 [2025-04-13 23:33:39,058 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:33:39,058 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 317 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 1603 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:39,058 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 119 Invalid, 1626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1603 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:33:39,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12632 states. [2025-04-13 23:33:39,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12632 to 6521. [2025-04-13 23:33:39,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6521 states, 6520 states have (on average 3.6607361963190184) internal successors, (23868), 6520 states have internal predecessors, (23868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6521 states to 6521 states and 23868 transitions. [2025-04-13 23:33:39,285 INFO L79 Accepts]: Start accepts. Automaton has 6521 states and 23868 transitions. Word has length 54 [2025-04-13 23:33:39,285 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:39,285 INFO L485 AbstractCegarLoop]: Abstraction has 6521 states and 23868 transitions. [2025-04-13 23:33:39,285 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:39,285 INFO L278 IsEmpty]: Start isEmpty. Operand 6521 states and 23868 transitions. [2025-04-13 23:33:39,295 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:39,296 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:39,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:39,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable362 [2025-04-13 23:33:39,296 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 23:33:39,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:39,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1218601109, now seen corresponding path program 364 times [2025-04-13 23:33:39,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:39,297 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954303838] [2025-04-13 23:33:39,297 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:33:39,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:39,299 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:33:39,310 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 23:33:39,310 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:33:39,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:39,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:39,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:39,899 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954303838] [2025-04-13 23:33:39,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954303838] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:39,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:39,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:39,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122043375] [2025-04-13 23:33:39,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:39,900 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:39,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:39,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:39,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:39,900 INFO L87 Difference]: Start difference. First operand 6521 states and 23868 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:40,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:40,782 INFO L93 Difference]: Finished difference Result 11054 states and 39477 transitions. [2025-04-13 23:33:40,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:40,782 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:40,782 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:40,837 INFO L225 Difference]: With dead ends: 11054 [2025-04-13 23:33:40,837 INFO L226 Difference]: Without dead ends: 10860 [2025-04-13 23:33:40,841 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:33:40,841 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 262 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:40,841 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 101 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1384 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:33:40,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10860 states. [2025-04-13 23:33:40,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10860 to 6441. [2025-04-13 23:33:40,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6441 states, 6440 states have (on average 3.66583850931677) internal successors, (23608), 6440 states have internal predecessors, (23608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:40,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6441 states to 6441 states and 23608 transitions. [2025-04-13 23:33:40,991 INFO L79 Accepts]: Start accepts. Automaton has 6441 states and 23608 transitions. Word has length 54 [2025-04-13 23:33:40,991 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:40,991 INFO L485 AbstractCegarLoop]: Abstraction has 6441 states and 23608 transitions. [2025-04-13 23:33:40,991 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:40,991 INFO L278 IsEmpty]: Start isEmpty. Operand 6441 states and 23608 transitions. [2025-04-13 23:33:41,001 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:41,001 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:41,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:41,001 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable363 [2025-04-13 23:33:41,001 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 23:33:41,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash 919501721, now seen corresponding path program 365 times [2025-04-13 23:33:41,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:41,002 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290813335] [2025-04-13 23:33:41,002 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:33:41,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:41,004 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:41,014 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:41,014 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:33:41,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:41,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:41,619 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290813335] [2025-04-13 23:33:41,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290813335] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:41,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:41,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:41,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922300279] [2025-04-13 23:33:41,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:41,620 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:41,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:41,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:41,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:41,620 INFO L87 Difference]: Start difference. First operand 6441 states and 23608 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:42,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:42,528 INFO L93 Difference]: Finished difference Result 12643 states and 44967 transitions. [2025-04-13 23:33:42,528 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:42,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 23:33:42,529 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:42,585 INFO L225 Difference]: With dead ends: 12643 [2025-04-13 23:33:42,585 INFO L226 Difference]: Without dead ends: 12526 [2025-04-13 23:33:42,590 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 23:33:42,590 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 301 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:42,590 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 116 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:33:42,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12526 states. [2025-04-13 23:33:42,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12526 to 6540. [2025-04-13 23:33:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6540 states, 6539 states have (on average 3.6559106897079063) internal successors, (23906), 6539 states have internal predecessors, (23906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:42,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6540 states to 6540 states and 23906 transitions. [2025-04-13 23:33:42,756 INFO L79 Accepts]: Start accepts. Automaton has 6540 states and 23906 transitions. Word has length 54 [2025-04-13 23:33:42,756 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:42,756 INFO L485 AbstractCegarLoop]: Abstraction has 6540 states and 23906 transitions. [2025-04-13 23:33:42,756 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:42,756 INFO L278 IsEmpty]: Start isEmpty. Operand 6540 states and 23906 transitions. [2025-04-13 23:33:42,766 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:42,766 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:42,766 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:42,766 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable364 [2025-04-13 23:33:42,766 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 23:33:42,766 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:42,767 INFO L85 PathProgramCache]: Analyzing trace with hash -219728699, now seen corresponding path program 366 times [2025-04-13 23:33:42,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:42,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466731824] [2025-04-13 23:33:42,767 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:33:42,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:42,769 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:42,779 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:42,779 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:33:42,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:43,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:43,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:43,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466731824] [2025-04-13 23:33:43,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466731824] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:43,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:43,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:43,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563929627] [2025-04-13 23:33:43,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:43,451 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:43,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:43,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:43,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:43,451 INFO L87 Difference]: Start difference. First operand 6540 states and 23906 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:44,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:44,367 INFO L93 Difference]: Finished difference Result 11499 states and 40838 transitions. [2025-04-13 23:33:44,367 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:44,367 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:44,367 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:44,417 INFO L225 Difference]: With dead ends: 11499 [2025-04-13 23:33:44,418 INFO L226 Difference]: Without dead ends: 11431 [2025-04-13 23:33:44,421 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:33:44,422 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 280 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 1687 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:44,422 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 130 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1687 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:33:44,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11431 states. [2025-04-13 23:33:44,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11431 to 6615. [2025-04-13 23:33:44,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6615 states, 6614 states have (on average 3.654520713637738) internal successors, (24171), 6614 states have internal predecessors, (24171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:44,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6615 states to 6615 states and 24171 transitions. [2025-04-13 23:33:44,573 INFO L79 Accepts]: Start accepts. Automaton has 6615 states and 24171 transitions. Word has length 54 [2025-04-13 23:33:44,573 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:44,573 INFO L485 AbstractCegarLoop]: Abstraction has 6615 states and 24171 transitions. [2025-04-13 23:33:44,573 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:44,573 INFO L278 IsEmpty]: Start isEmpty. Operand 6615 states and 24171 transitions. [2025-04-13 23:33:44,584 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:44,584 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:44,584 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:44,584 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable365 [2025-04-13 23:33:44,584 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 23:33:44,584 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:44,584 INFO L85 PathProgramCache]: Analyzing trace with hash -538514923, now seen corresponding path program 367 times [2025-04-13 23:33:44,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:44,584 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37334092] [2025-04-13 23:33:44,584 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:33:44,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:44,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:44,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:44,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:33:44,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:45,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 23:33:45,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:45,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37334092] [2025-04-13 23:33:45,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37334092] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:45,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:45,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:45,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172189314] [2025-04-13 23:33:45,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:45,188 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:45,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:45,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:45,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:45,189 INFO L87 Difference]: Start difference. First operand 6615 states and 24171 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:46,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:46,134 INFO L93 Difference]: Finished difference Result 12753 states and 45292 transitions. [2025-04-13 23:33:46,134 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:46,134 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:46,134 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:46,186 INFO L225 Difference]: With dead ends: 12753 [2025-04-13 23:33:46,186 INFO L226 Difference]: Without dead ends: 12682 [2025-04-13 23:33:46,189 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 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 23:33:46,189 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 346 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:46,189 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 103 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:33:46,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12682 states. [2025-04-13 23:33:46,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12682 to 6626. [2025-04-13 23:33:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6626 states, 6625 states have (on average 3.6525283018867927) internal successors, (24198), 6625 states have internal predecessors, (24198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:46,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6626 states to 6626 states and 24198 transitions. [2025-04-13 23:33:46,346 INFO L79 Accepts]: Start accepts. Automaton has 6626 states and 24198 transitions. Word has length 54 [2025-04-13 23:33:46,346 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:46,346 INFO L485 AbstractCegarLoop]: Abstraction has 6626 states and 24198 transitions. [2025-04-13 23:33:46,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 23:33:46,346 INFO L278 IsEmpty]: Start isEmpty. Operand 6626 states and 24198 transitions. [2025-04-13 23:33:46,356 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:46,356 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:46,356 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:46,356 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable366 [2025-04-13 23:33:46,356 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 23:33:46,357 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:46,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1019733275, now seen corresponding path program 368 times [2025-04-13 23:33:46,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:46,357 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068980188] [2025-04-13 23:33:46,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:33:46,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:46,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:46,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:46,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:33:46,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:47,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:47,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:47,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068980188] [2025-04-13 23:33:47,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068980188] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:47,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:47,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:47,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803307444] [2025-04-13 23:33:47,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:47,012 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:47,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:47,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:47,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:47,013 INFO L87 Difference]: Start difference. First operand 6626 states and 24198 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:47,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:47,946 INFO L93 Difference]: Finished difference Result 11513 states and 40862 transitions. [2025-04-13 23:33:47,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:47,946 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:47,946 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:48,000 INFO L225 Difference]: With dead ends: 11513 [2025-04-13 23:33:48,000 INFO L226 Difference]: Without dead ends: 11432 [2025-04-13 23:33:48,004 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:33:48,004 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 271 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:48,004 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 135 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:33:48,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11432 states. [2025-04-13 23:33:48,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11432 to 6616. [2025-04-13 23:33:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6616 states, 6615 states have (on average 3.65275888133031) internal successors, (24163), 6615 states have internal predecessors, (24163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:48,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6616 states to 6616 states and 24163 transitions. [2025-04-13 23:33:48,205 INFO L79 Accepts]: Start accepts. Automaton has 6616 states and 24163 transitions. Word has length 54 [2025-04-13 23:33:48,205 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:48,205 INFO L485 AbstractCegarLoop]: Abstraction has 6616 states and 24163 transitions. [2025-04-13 23:33:48,205 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:48,205 INFO L278 IsEmpty]: Start isEmpty. Operand 6616 states and 24163 transitions. [2025-04-13 23:33:48,216 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:48,216 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:48,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 23:33:48,216 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable367 [2025-04-13 23:33:48,216 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 23:33:48,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:48,217 INFO L85 PathProgramCache]: Analyzing trace with hash -2073344895, now seen corresponding path program 369 times [2025-04-13 23:33:48,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:48,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667332736] [2025-04-13 23:33:48,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:33:48,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:48,219 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:48,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:48,230 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:33:48,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:48,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:48,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667332736] [2025-04-13 23:33:48,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667332736] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:48,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:48,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:48,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764858471] [2025-04-13 23:33:48,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:48,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:48,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:48,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:48,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:48,805 INFO L87 Difference]: Start difference. First operand 6616 states and 24163 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:49,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:49,732 INFO L93 Difference]: Finished difference Result 12672 states and 45066 transitions. [2025-04-13 23:33:49,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:49,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 23:33:49,732 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:49,789 INFO L225 Difference]: With dead ends: 12672 [2025-04-13 23:33:49,789 INFO L226 Difference]: Without dead ends: 12569 [2025-04-13 23:33:49,793 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 23:33:49,793 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 305 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:49,793 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 114 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1605 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:33:49,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12569 states. [2025-04-13 23:33:49,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12569 to 6583. [2025-04-13 23:33:49,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6583 states, 6582 states have (on average 3.6554238833181403) internal successors, (24060), 6582 states have internal predecessors, (24060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6583 states to 6583 states and 24060 transitions. [2025-04-13 23:33:49,965 INFO L79 Accepts]: Start accepts. Automaton has 6583 states and 24060 transitions. Word has length 54 [2025-04-13 23:33:49,965 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:49,965 INFO L485 AbstractCegarLoop]: Abstraction has 6583 states and 24060 transitions. [2025-04-13 23:33:49,965 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:49,965 INFO L278 IsEmpty]: Start isEmpty. Operand 6583 states and 24060 transitions. [2025-04-13 23:33:49,976 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:49,976 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:49,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 23:33:49,976 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable368 [2025-04-13 23:33:49,976 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 23:33:49,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:49,976 INFO L85 PathProgramCache]: Analyzing trace with hash 694631143, now seen corresponding path program 370 times [2025-04-13 23:33:49,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:49,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470893330] [2025-04-13 23:33:49,976 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:33:49,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:49,979 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:33:49,989 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 23:33:49,989 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:33:49,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:50,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:50,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470893330] [2025-04-13 23:33:50,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470893330] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:50,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:50,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 23:33:50,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105755164] [2025-04-13 23:33:50,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:50,709 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:33:50,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:50,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:33:50,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:33:50,710 INFO L87 Difference]: Start difference. First operand 6583 states and 24060 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:51,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:51,886 INFO L93 Difference]: Finished difference Result 13410 states and 46893 transitions. [2025-04-13 23:33:51,886 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 23:33:51,886 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:51,886 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:51,938 INFO L225 Difference]: With dead ends: 13410 [2025-04-13 23:33:51,938 INFO L226 Difference]: Without dead ends: 13207 [2025-04-13 23:33:51,943 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=331, Invalid=725, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:33:51,943 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 415 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 1899 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:51,943 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 143 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1899 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:33:51,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13207 states. [2025-04-13 23:33:52,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13207 to 6563. [2025-04-13 23:33:52,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6563 states, 6562 states have (on average 3.6558975921975008) internal successors, (23990), 6562 states have internal predecessors, (23990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6563 states to 6563 states and 23990 transitions. [2025-04-13 23:33:52,109 INFO L79 Accepts]: Start accepts. Automaton has 6563 states and 23990 transitions. Word has length 54 [2025-04-13 23:33:52,109 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:52,109 INFO L485 AbstractCegarLoop]: Abstraction has 6563 states and 23990 transitions. [2025-04-13 23:33:52,109 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:52,110 INFO L278 IsEmpty]: Start isEmpty. Operand 6563 states and 23990 transitions. [2025-04-13 23:33:52,120 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:52,120 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:52,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 23:33:52,120 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable369 [2025-04-13 23:33:52,120 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 23:33:52,120 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:52,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1309275641, now seen corresponding path program 371 times [2025-04-13 23:33:52,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:52,120 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807035839] [2025-04-13 23:33:52,120 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:33:52,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:52,123 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:52,133 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:52,133 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:33:52,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:52,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 23:33:52,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:52,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807035839] [2025-04-13 23:33:52,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807035839] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:52,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:52,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:52,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31650091] [2025-04-13 23:33:52,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:52,706 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:52,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:52,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:52,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:52,706 INFO L87 Difference]: Start difference. First operand 6563 states and 23990 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:53,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:53,537 INFO L93 Difference]: Finished difference Result 12663 states and 45034 transitions. [2025-04-13 23:33:53,537 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:53,538 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:53,538 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:53,590 INFO L225 Difference]: With dead ends: 12663 [2025-04-13 23:33:53,590 INFO L226 Difference]: Without dead ends: 12592 [2025-04-13 23:33:53,595 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 23:33:53,595 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 310 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:53,595 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 97 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:33:53,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12592 states. [2025-04-13 23:33:53,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12592 to 6596. [2025-04-13 23:33:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6596 states, 6595 states have (on average 3.6532221379833207) internal successors, (24093), 6595 states have internal predecessors, (24093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:53,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6596 states to 6596 states and 24093 transitions. [2025-04-13 23:33:53,762 INFO L79 Accepts]: Start accepts. Automaton has 6596 states and 24093 transitions. Word has length 54 [2025-04-13 23:33:53,762 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:53,762 INFO L485 AbstractCegarLoop]: Abstraction has 6596 states and 24093 transitions. [2025-04-13 23:33:53,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:53,763 INFO L278 IsEmpty]: Start isEmpty. Operand 6596 states and 24093 transitions. [2025-04-13 23:33:53,772 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:53,773 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:53,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:53,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable370 [2025-04-13 23:33:53,773 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 23:33:53,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:53,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1757147929, now seen corresponding path program 372 times [2025-04-13 23:33:53,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:53,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959206970] [2025-04-13 23:33:53,773 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:33:53,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:53,776 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:53,786 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:53,786 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:33:53,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:54,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:54,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:54,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959206970] [2025-04-13 23:33:54,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959206970] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:54,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:54,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:54,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936192152] [2025-04-13 23:33:54,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:54,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:54,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:54,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:54,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:54,371 INFO L87 Difference]: Start difference. First operand 6596 states and 24093 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:55,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:55,334 INFO L93 Difference]: Finished difference Result 11677 states and 41296 transitions. [2025-04-13 23:33:55,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:55,334 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:55,334 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:55,386 INFO L225 Difference]: With dead ends: 11677 [2025-04-13 23:33:55,386 INFO L226 Difference]: Without dead ends: 11609 [2025-04-13 23:33:55,390 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:33:55,390 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 302 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1769 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:55,390 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 136 Invalid, 1790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1769 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:33:55,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11609 states. [2025-04-13 23:33:55,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11609 to 6611. [2025-04-13 23:33:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6611 states, 6610 states have (on average 3.6517397881996976) internal successors, (24138), 6610 states have internal predecessors, (24138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6611 states to 6611 states and 24138 transitions. [2025-04-13 23:33:55,553 INFO L79 Accepts]: Start accepts. Automaton has 6611 states and 24138 transitions. Word has length 54 [2025-04-13 23:33:55,553 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:55,553 INFO L485 AbstractCegarLoop]: Abstraction has 6611 states and 24138 transitions. [2025-04-13 23:33:55,553 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:55,553 INFO L278 IsEmpty]: Start isEmpty. Operand 6611 states and 24138 transitions. [2025-04-13 23:33:55,563 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:55,564 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:55,564 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:55,564 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable371 [2025-04-13 23:33:55,564 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 23:33:55,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:55,564 INFO L85 PathProgramCache]: Analyzing trace with hash -225554331, now seen corresponding path program 373 times [2025-04-13 23:33:55,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:55,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735834576] [2025-04-13 23:33:55,564 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:33:55,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:55,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:55,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:55,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:33:55,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:56,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 23:33:56,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:56,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735834576] [2025-04-13 23:33:56,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735834576] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:56,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:56,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:56,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010769046] [2025-04-13 23:33:56,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:56,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:56,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:56,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:56,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:56,175 INFO L87 Difference]: Start difference. First operand 6611 states and 24138 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:57,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:57,151 INFO L93 Difference]: Finished difference Result 12677 states and 45066 transitions. [2025-04-13 23:33:57,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:57,151 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:57,151 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:57,207 INFO L225 Difference]: With dead ends: 12677 [2025-04-13 23:33:57,207 INFO L226 Difference]: Without dead ends: 12596 [2025-04-13 23:33:57,212 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 23:33:57,212 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 273 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:57,212 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 137 Invalid, 1807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:33:57,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12596 states. [2025-04-13 23:33:57,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12596 to 6600. [2025-04-13 23:33:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6600 states, 6599 states have (on average 3.6520684952265494) internal successors, (24100), 6599 states have internal predecessors, (24100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6600 states to 6600 states and 24100 transitions. [2025-04-13 23:33:57,379 INFO L79 Accepts]: Start accepts. Automaton has 6600 states and 24100 transitions. Word has length 54 [2025-04-13 23:33:57,379 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:57,379 INFO L485 AbstractCegarLoop]: Abstraction has 6600 states and 24100 transitions. [2025-04-13 23:33:57,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 23:33:57,379 INFO L278 IsEmpty]: Start isEmpty. Operand 6600 states and 24100 transitions. [2025-04-13 23:33:57,413 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:57,413 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:57,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 23:33:57,413 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable372 [2025-04-13 23:33:57,413 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 23:33:57,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:57,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1737814791, now seen corresponding path program 374 times [2025-04-13 23:33:57,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:57,414 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609905493] [2025-04-13 23:33:57,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:33:57,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:57,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:57,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:57,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:33:57,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:58,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:33:58,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:58,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609905493] [2025-04-13 23:33:58,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609905493] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:58,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:58,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:58,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153994798] [2025-04-13 23:33:58,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:58,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:58,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:58,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:58,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:58,036 INFO L87 Difference]: Start difference. First operand 6600 states and 24100 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:59,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:33:59,051 INFO L93 Difference]: Finished difference Result 11669 states and 41255 transitions. [2025-04-13 23:33:59,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:33:59,051 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:33:59,051 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:33:59,103 INFO L225 Difference]: With dead ends: 11669 [2025-04-13 23:33:59,103 INFO L226 Difference]: Without dead ends: 11588 [2025-04-13 23:33:59,107 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:33:59,107 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 280 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 1876 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 1896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:33:59,107 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 149 Invalid, 1896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1876 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:33:59,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11588 states. [2025-04-13 23:33:59,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11588 to 6590. [2025-04-13 23:33:59,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6590 states, 6589 states have (on average 3.6530581271816662) internal successors, (24070), 6589 states have internal predecessors, (24070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:33:59,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6590 states to 6590 states and 24070 transitions. [2025-04-13 23:33:59,275 INFO L79 Accepts]: Start accepts. Automaton has 6590 states and 24070 transitions. Word has length 54 [2025-04-13 23:33:59,276 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:33:59,276 INFO L485 AbstractCegarLoop]: Abstraction has 6590 states and 24070 transitions. [2025-04-13 23:33:59,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 23:33:59,276 INFO L278 IsEmpty]: Start isEmpty. Operand 6590 states and 24070 transitions. [2025-04-13 23:33:59,286 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:33:59,286 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:33:59,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:33:59,286 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable373 [2025-04-13 23:33:59,286 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 23:33:59,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:33:59,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1117729037, now seen corresponding path program 375 times [2025-04-13 23:33:59,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:33:59,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296176874] [2025-04-13 23:33:59,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:33:59,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:33:59,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:33:59,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:33:59,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:33:59,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:33:59,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 23:33:59,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:33:59,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296176874] [2025-04-13 23:33:59,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296176874] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:33:59,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:33:59,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:33:59,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436627680] [2025-04-13 23:33:59,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:33:59,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:33:59,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:33:59,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:33:59,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:33:59,927 INFO L87 Difference]: Start difference. First operand 6590 states and 24070 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:00,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:00,850 INFO L93 Difference]: Finished difference Result 12586 states and 44820 transitions. [2025-04-13 23:34:00,850 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:00,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 23:34:00,850 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:00,903 INFO L225 Difference]: With dead ends: 12586 [2025-04-13 23:34:00,903 INFO L226 Difference]: Without dead ends: 12373 [2025-04-13 23:34:00,908 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 23:34:00,908 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 260 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 1647 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:00,908 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 121 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1647 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:34:00,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12373 states. [2025-04-13 23:34:01,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12373 to 6491. [2025-04-13 23:34:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6491 states, 6490 states have (on average 3.6602465331278893) internal successors, (23755), 6490 states have internal predecessors, (23755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6491 states to 6491 states and 23755 transitions. [2025-04-13 23:34:01,076 INFO L79 Accepts]: Start accepts. Automaton has 6491 states and 23755 transitions. Word has length 54 [2025-04-13 23:34:01,076 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:01,076 INFO L485 AbstractCegarLoop]: Abstraction has 6491 states and 23755 transitions. [2025-04-13 23:34:01,076 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:01,076 INFO L278 IsEmpty]: Start isEmpty. Operand 6491 states and 23755 transitions. [2025-04-13 23:34:01,086 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:01,086 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:01,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:34:01,086 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable374 [2025-04-13 23:34:01,087 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 23:34:01,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:01,087 INFO L85 PathProgramCache]: Analyzing trace with hash -836571963, now seen corresponding path program 376 times [2025-04-13 23:34:01,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:01,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182059387] [2025-04-13 23:34:01,087 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:34:01,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:01,089 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:34:01,100 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 23:34:01,100 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:34:01,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:01,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 23:34:01,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:01,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182059387] [2025-04-13 23:34:01,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182059387] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:01,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:01,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:01,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365266067] [2025-04-13 23:34:01,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:01,758 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:01,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:01,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:01,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:01,758 INFO L87 Difference]: Start difference. First operand 6491 states and 23755 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:02,696 INFO L93 Difference]: Finished difference Result 11466 states and 40663 transitions. [2025-04-13 23:34:02,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:34:02,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 23:34:02,697 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:02,745 INFO L225 Difference]: With dead ends: 11466 [2025-04-13 23:34:02,745 INFO L226 Difference]: Without dead ends: 11398 [2025-04-13 23:34:02,749 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:34:02,749 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 298 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 1718 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:02,749 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 133 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1718 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:34:02,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11398 states. [2025-04-13 23:34:02,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11398 to 6501. [2025-04-13 23:34:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6501 states, 6500 states have (on average 3.6584615384615384) internal successors, (23780), 6500 states have internal predecessors, (23780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:02,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6501 states to 6501 states and 23780 transitions. [2025-04-13 23:34:02,904 INFO L79 Accepts]: Start accepts. Automaton has 6501 states and 23780 transitions. Word has length 54 [2025-04-13 23:34:02,904 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:02,904 INFO L485 AbstractCegarLoop]: Abstraction has 6501 states and 23780 transitions. [2025-04-13 23:34:02,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 23:34:02,904 INFO L278 IsEmpty]: Start isEmpty. Operand 6501 states and 23780 transitions. [2025-04-13 23:34:02,914 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:02,914 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:02,914 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:34:02,915 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable375 [2025-04-13 23:34:02,915 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 23:34:02,915 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:02,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1011733691, now seen corresponding path program 377 times [2025-04-13 23:34:02,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:02,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902180525] [2025-04-13 23:34:02,915 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:34:02,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:02,917 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:02,928 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:02,928 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:34:02,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:03,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 23:34:03,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:03,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902180525] [2025-04-13 23:34:03,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902180525] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:03,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:03,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:03,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818756134] [2025-04-13 23:34:03,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:03,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:03,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:03,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:03,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:03,530 INFO L87 Difference]: Start difference. First operand 6501 states and 23780 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:04,341 INFO L93 Difference]: Finished difference Result 12542 states and 44647 transitions. [2025-04-13 23:34:04,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:04,341 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:04,341 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:04,391 INFO L225 Difference]: With dead ends: 12542 [2025-04-13 23:34:04,391 INFO L226 Difference]: Without dead ends: 12471 [2025-04-13 23:34:04,395 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:34:04,395 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 299 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:04,396 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 113 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:34:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12471 states. [2025-04-13 23:34:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12471 to 6521. [2025-04-13 23:34:04,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6521 states, 6520 states have (on average 3.657668711656442) internal successors, (23848), 6520 states have internal predecessors, (23848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6521 states to 6521 states and 23848 transitions. [2025-04-13 23:34:04,562 INFO L79 Accepts]: Start accepts. Automaton has 6521 states and 23848 transitions. Word has length 54 [2025-04-13 23:34:04,562 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:04,562 INFO L485 AbstractCegarLoop]: Abstraction has 6521 states and 23848 transitions. [2025-04-13 23:34:04,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 23:34:04,562 INFO L278 IsEmpty]: Start isEmpty. Operand 6521 states and 23848 transitions. [2025-04-13 23:34:04,573 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:04,573 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:04,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 23:34:04,574 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable376 [2025-04-13 23:34:04,574 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 23:34:04,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:04,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1607049945, now seen corresponding path program 378 times [2025-04-13 23:34:04,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:04,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009263209] [2025-04-13 23:34:04,574 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:34:04,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:04,577 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:04,588 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:04,588 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:34:04,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:05,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:34:05,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:05,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009263209] [2025-04-13 23:34:05,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009263209] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:05,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:05,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:05,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087230495] [2025-04-13 23:34:05,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:05,182 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:05,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:05,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:05,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:05,182 INFO L87 Difference]: Start difference. First operand 6521 states and 23848 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:06,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:06,301 INFO L93 Difference]: Finished difference Result 11440 states and 40613 transitions. [2025-04-13 23:34:06,301 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 23:34:06,301 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:06,301 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:06,396 INFO L225 Difference]: With dead ends: 11440 [2025-04-13 23:34:06,397 INFO L226 Difference]: Without dead ends: 11360 [2025-04-13 23:34:06,399 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:34:06,399 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 302 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:06,399 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 124 Invalid, 1664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:34:06,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11360 states. [2025-04-13 23:34:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11360 to 6511. [2025-04-13 23:34:06,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6511 states, 6510 states have (on average 3.658678955453149) internal successors, (23818), 6510 states have internal predecessors, (23818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6511 states to 6511 states and 23818 transitions. [2025-04-13 23:34:06,538 INFO L79 Accepts]: Start accepts. Automaton has 6511 states and 23818 transitions. Word has length 54 [2025-04-13 23:34:06,538 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:06,538 INFO L485 AbstractCegarLoop]: Abstraction has 6511 states and 23818 transitions. [2025-04-13 23:34:06,538 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:06,538 INFO L278 IsEmpty]: Start isEmpty. Operand 6511 states and 23818 transitions. [2025-04-13 23:34:06,549 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:06,549 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:06,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 23:34:06,549 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable377 [2025-04-13 23:34:06,549 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 23:34:06,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:06,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1399599357, now seen corresponding path program 379 times [2025-04-13 23:34:06,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:06,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702953422] [2025-04-13 23:34:06,550 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:34:06,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:06,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:06,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:06,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:34:06,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:07,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:34:07,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:07,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702953422] [2025-04-13 23:34:07,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702953422] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:07,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:07,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:07,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444470662] [2025-04-13 23:34:07,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:07,127 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:07,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:07,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:07,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:07,127 INFO L87 Difference]: Start difference. First operand 6511 states and 23818 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:07,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:07,934 INFO L93 Difference]: Finished difference Result 12525 states and 44590 transitions. [2025-04-13 23:34:07,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:07,934 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:07,935 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:07,992 INFO L225 Difference]: With dead ends: 12525 [2025-04-13 23:34:07,992 INFO L226 Difference]: Without dead ends: 12453 [2025-04-13 23:34:07,997 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:34:07,997 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 300 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:07,997 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 105 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1422 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:34:08,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12453 states. [2025-04-13 23:34:08,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12453 to 6503. [2025-04-13 23:34:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6503 states, 6502 states have (on average 3.6594893878806523) internal successors, (23794), 6502 states have internal predecessors, (23794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6503 states to 6503 states and 23794 transitions. [2025-04-13 23:34:08,165 INFO L79 Accepts]: Start accepts. Automaton has 6503 states and 23794 transitions. Word has length 54 [2025-04-13 23:34:08,165 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:08,165 INFO L485 AbstractCegarLoop]: Abstraction has 6503 states and 23794 transitions. [2025-04-13 23:34: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 23:34:08,165 INFO L278 IsEmpty]: Start isEmpty. Operand 6503 states and 23794 transitions. [2025-04-13 23:34:08,175 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:08,175 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:08,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:34:08,175 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable378 [2025-04-13 23:34:08,175 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 23:34:08,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:08,176 INFO L85 PathProgramCache]: Analyzing trace with hash -672166171, now seen corresponding path program 380 times [2025-04-13 23:34:08,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:08,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304006291] [2025-04-13 23:34:08,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:34:08,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:08,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:08,190 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:08,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:34:08,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:34:08,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:08,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304006291] [2025-04-13 23:34:08,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304006291] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:08,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:08,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:08,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387856986] [2025-04-13 23:34:08,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:08,821 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:08,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:08,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:08,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:08,821 INFO L87 Difference]: Start difference. First operand 6503 states and 23794 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:09,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:09,852 INFO L93 Difference]: Finished difference Result 11504 states and 40777 transitions. [2025-04-13 23:34:09,852 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:34:09,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 23:34:09,852 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:09,901 INFO L225 Difference]: With dead ends: 11504 [2025-04-13 23:34:09,901 INFO L226 Difference]: Without dead ends: 11433 [2025-04-13 23:34:09,905 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 23:34:09,905 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 294 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:09,905 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 116 Invalid, 1594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:34:09,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11433 states. [2025-04-13 23:34:10,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11433 to 6514. [2025-04-13 23:34:10,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6514 states, 6513 states have (on average 3.657454322124981) internal successors, (23821), 6513 states have internal predecessors, (23821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:10,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6514 states to 6514 states and 23821 transitions. [2025-04-13 23:34:10,069 INFO L79 Accepts]: Start accepts. Automaton has 6514 states and 23821 transitions. Word has length 54 [2025-04-13 23:34:10,069 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:10,069 INFO L485 AbstractCegarLoop]: Abstraction has 6514 states and 23821 transitions. [2025-04-13 23:34:10,069 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:10,069 INFO L278 IsEmpty]: Start isEmpty. Operand 6514 states and 23821 transitions. [2025-04-13 23:34:10,079 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:10,079 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:10,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:34:10,079 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable379 [2025-04-13 23:34:10,079 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 23:34:10,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:10,080 INFO L85 PathProgramCache]: Analyzing trace with hash 848935579, now seen corresponding path program 381 times [2025-04-13 23:34:10,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:10,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474443286] [2025-04-13 23:34:10,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:34:10,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:10,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:10,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:10,092 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:34:10,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:10,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 23:34:10,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:10,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474443286] [2025-04-13 23:34:10,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474443286] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:10,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:10,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:10,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214049640] [2025-04-13 23:34:10,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:10,678 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:10,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:10,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:10,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:10,678 INFO L87 Difference]: Start difference. First operand 6514 states and 23821 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:11,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:11,514 INFO L93 Difference]: Finished difference Result 12616 states and 44828 transitions. [2025-04-13 23:34:11,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:11,514 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:11,514 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:11,564 INFO L225 Difference]: With dead ends: 12616 [2025-04-13 23:34:11,564 INFO L226 Difference]: Without dead ends: 12545 [2025-04-13 23:34:11,568 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:34:11,568 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 348 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:11,568 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 109 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:34:11,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12545 states. [2025-04-13 23:34:11,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12545 to 6514. [2025-04-13 23:34:11,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6514 states, 6513 states have (on average 3.657454322124981) internal successors, (23821), 6513 states have internal predecessors, (23821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6514 states to 6514 states and 23821 transitions. [2025-04-13 23:34:11,739 INFO L79 Accepts]: Start accepts. Automaton has 6514 states and 23821 transitions. Word has length 54 [2025-04-13 23:34:11,739 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:11,740 INFO L485 AbstractCegarLoop]: Abstraction has 6514 states and 23821 transitions. [2025-04-13 23:34:11,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 23:34:11,740 INFO L278 IsEmpty]: Start isEmpty. Operand 6514 states and 23821 transitions. [2025-04-13 23:34:11,750 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:11,750 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:11,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:34:11,750 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable380 [2025-04-13 23:34:11,750 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 23:34:11,750 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:11,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1612301497, now seen corresponding path program 382 times [2025-04-13 23:34:11,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:11,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196486633] [2025-04-13 23:34:11,751 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:34:11,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:11,753 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:34:11,764 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 23:34:11,764 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:34:11,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:12,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:34:12,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:12,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196486633] [2025-04-13 23:34:12,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196486633] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:12,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:12,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:12,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598317761] [2025-04-13 23:34:12,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:12,356 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:12,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:12,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:12,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:12,356 INFO L87 Difference]: Start difference. First operand 6514 states and 23821 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:13,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:13,258 INFO L93 Difference]: Finished difference Result 11444 states and 40613 transitions. [2025-04-13 23:34:13,258 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:13,258 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:13,258 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:13,310 INFO L225 Difference]: With dead ends: 11444 [2025-04-13 23:34:13,310 INFO L226 Difference]: Without dead ends: 11358 [2025-04-13 23:34:13,314 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:34:13,314 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 275 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1633 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:13,314 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 125 Invalid, 1652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1633 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:34:13,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11358 states. [2025-04-13 23:34:13,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11358 to 6509. [2025-04-13 23:34:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6509 states, 6508 states have (on average 3.657959434542102) internal successors, (23806), 6508 states have internal predecessors, (23806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6509 states to 6509 states and 23806 transitions. [2025-04-13 23:34:13,485 INFO L79 Accepts]: Start accepts. Automaton has 6509 states and 23806 transitions. Word has length 54 [2025-04-13 23:34:13,485 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:13,485 INFO L485 AbstractCegarLoop]: Abstraction has 6509 states and 23806 transitions. [2025-04-13 23:34:13,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 23:34:13,485 INFO L278 IsEmpty]: Start isEmpty. Operand 6509 states and 23806 transitions. [2025-04-13 23:34:13,496 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:13,496 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:13,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 23:34:13,496 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable381 [2025-04-13 23:34:13,496 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 23:34:13,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:13,496 INFO L85 PathProgramCache]: Analyzing trace with hash -660385115, now seen corresponding path program 383 times [2025-04-13 23:34:13,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:13,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520970529] [2025-04-13 23:34:13,496 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:34:13,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:13,499 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:13,509 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:13,509 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:34:13,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:34:14,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:14,084 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520970529] [2025-04-13 23:34:14,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520970529] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:14,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:14,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:14,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751849443] [2025-04-13 23:34:14,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:14,084 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:14,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:14,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:14,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:14,085 INFO L87 Difference]: Start difference. First operand 6509 states and 23806 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:14,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:14,913 INFO L93 Difference]: Finished difference Result 12551 states and 44660 transitions. [2025-04-13 23:34:14,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:14,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 23:34:14,914 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:14,965 INFO L225 Difference]: With dead ends: 12551 [2025-04-13 23:34:14,965 INFO L226 Difference]: Without dead ends: 12470 [2025-04-13 23:34:14,969 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:34:14,970 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 287 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:14,970 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 110 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:34:14,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12470 states. [2025-04-13 23:34:15,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12470 to 6498. [2025-04-13 23:34:15,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6498 states, 6497 states have (on average 3.6593812528859475) internal successors, (23775), 6497 states have internal predecessors, (23775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6498 states to 6498 states and 23775 transitions. [2025-04-13 23:34:15,167 INFO L79 Accepts]: Start accepts. Automaton has 6498 states and 23775 transitions. Word has length 54 [2025-04-13 23:34:15,167 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:15,167 INFO L485 AbstractCegarLoop]: Abstraction has 6498 states and 23775 transitions. [2025-04-13 23:34:15,167 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:15,167 INFO L278 IsEmpty]: Start isEmpty. Operand 6498 states and 23775 transitions. [2025-04-13 23:34:15,177 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:15,177 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:15,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:34:15,177 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable382 [2025-04-13 23:34:15,178 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 23:34:15,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:15,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1000334647, now seen corresponding path program 384 times [2025-04-13 23:34:15,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:15,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841339238] [2025-04-13 23:34:15,178 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:34:15,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:15,182 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:15,193 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:15,194 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:34:15,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:34:15,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:15,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841339238] [2025-04-13 23:34:15,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841339238] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:15,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:15,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:15,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221676884] [2025-04-13 23:34:15,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:15,850 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:15,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:15,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:15,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:15,851 INFO L87 Difference]: Start difference. First operand 6498 states and 23775 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:16,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:16,742 INFO L93 Difference]: Finished difference Result 11557 states and 40932 transitions. [2025-04-13 23:34:16,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:16,743 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:16,743 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:16,797 INFO L225 Difference]: With dead ends: 11557 [2025-04-13 23:34:16,797 INFO L226 Difference]: Without dead ends: 11440 [2025-04-13 23:34:16,801 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:34:16,801 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 294 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:16,801 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 112 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:34:16,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11440 states. [2025-04-13 23:34:16,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11440 to 6520. [2025-04-13 23:34:16,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6520 states, 6519 states have (on average 3.655315232397607) internal successors, (23829), 6519 states have internal predecessors, (23829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6520 states to 6520 states and 23829 transitions. [2025-04-13 23:34:16,967 INFO L79 Accepts]: Start accepts. Automaton has 6520 states and 23829 transitions. Word has length 54 [2025-04-13 23:34:16,968 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:16,968 INFO L485 AbstractCegarLoop]: Abstraction has 6520 states and 23829 transitions. [2025-04-13 23:34:16,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 23:34:16,968 INFO L278 IsEmpty]: Start isEmpty. Operand 6520 states and 23829 transitions. [2025-04-13 23:34:16,978 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:16,978 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:16,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:34:16,978 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable383 [2025-04-13 23:34:16,978 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 23:34:16,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:16,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1593411235, now seen corresponding path program 385 times [2025-04-13 23:34:16,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:16,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325723431] [2025-04-13 23:34:16,979 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:34:16,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:16,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:16,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:16,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:34:16,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:17,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:34:17,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:17,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325723431] [2025-04-13 23:34:17,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325723431] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:17,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:17,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:17,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657960436] [2025-04-13 23:34:17,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:17,582 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:17,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:17,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:17,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:17,582 INFO L87 Difference]: Start difference. First operand 6520 states and 23829 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:18,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:18,520 INFO L93 Difference]: Finished difference Result 12612 states and 44807 transitions. [2025-04-13 23:34:18,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:18,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 23:34:18,521 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:18,575 INFO L225 Difference]: With dead ends: 12612 [2025-04-13 23:34:18,576 INFO L226 Difference]: Without dead ends: 12548 [2025-04-13 23:34:18,581 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:34:18,582 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 314 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:18,582 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 136 Invalid, 1767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1744 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:34:18,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12548 states. [2025-04-13 23:34:18,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12548 to 6528. [2025-04-13 23:34:18,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6528 states, 6527 states have (on average 3.653899187988356) internal successors, (23849), 6527 states have internal predecessors, (23849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:18,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6528 states to 6528 states and 23849 transitions. [2025-04-13 23:34:18,755 INFO L79 Accepts]: Start accepts. Automaton has 6528 states and 23849 transitions. Word has length 54 [2025-04-13 23:34:18,755 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:18,755 INFO L485 AbstractCegarLoop]: Abstraction has 6528 states and 23849 transitions. [2025-04-13 23:34:18,755 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:18,755 INFO L278 IsEmpty]: Start isEmpty. Operand 6528 states and 23849 transitions. [2025-04-13 23:34:18,766 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:18,766 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:18,766 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:34:18,766 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable384 [2025-04-13 23:34:18,766 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 23:34:18,766 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:18,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1859565159, now seen corresponding path program 386 times [2025-04-13 23:34:18,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:18,766 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377115573] [2025-04-13 23:34:18,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:34:18,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:18,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:18,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:18,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:34:18,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:19,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 23:34:19,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:19,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377115573] [2025-04-13 23:34:19,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377115573] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:19,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:19,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:19,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343250886] [2025-04-13 23:34:19,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:19,376 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:19,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:19,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:19,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:19,376 INFO L87 Difference]: Start difference. First operand 6528 states and 23849 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:20,434 INFO L93 Difference]: Finished difference Result 11529 states and 40832 transitions. [2025-04-13 23:34:20,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:20,434 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:20,434 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:20,485 INFO L225 Difference]: With dead ends: 11529 [2025-04-13 23:34:20,485 INFO L226 Difference]: Without dead ends: 11458 [2025-04-13 23:34:20,489 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:34:20,490 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 290 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1589 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:20,490 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 117 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1589 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:34:20,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11458 states. [2025-04-13 23:34:20,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11458 to 6539. [2025-04-13 23:34:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6539 states, 6538 states have (on average 3.6518813092688895) internal successors, (23876), 6538 states have internal predecessors, (23876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:20,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6539 states to 6539 states and 23876 transitions. [2025-04-13 23:34:20,656 INFO L79 Accepts]: Start accepts. Automaton has 6539 states and 23876 transitions. Word has length 54 [2025-04-13 23:34:20,656 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:20,656 INFO L485 AbstractCegarLoop]: Abstraction has 6539 states and 23876 transitions. [2025-04-13 23:34:20,656 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:20,657 INFO L278 IsEmpty]: Start isEmpty. Operand 6539 states and 23876 transitions. [2025-04-13 23:34:20,667 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:20,667 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:20,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 23:34:20,667 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable385 [2025-04-13 23:34:20,667 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 23:34:20,667 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:20,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1588159683, now seen corresponding path program 387 times [2025-04-13 23:34:20,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:20,667 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374870570] [2025-04-13 23:34:20,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:34:20,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:20,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:20,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:20,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:34:20,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:34:21,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:21,273 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374870570] [2025-04-13 23:34:21,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374870570] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:21,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:21,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:21,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826152472] [2025-04-13 23:34:21,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:21,273 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:21,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:21,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:21,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:21,273 INFO L87 Difference]: Start difference. First operand 6539 states and 23876 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:22,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:22,113 INFO L93 Difference]: Finished difference Result 12581 states and 44730 transitions. [2025-04-13 23:34:22,114 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:22,114 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:22,114 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:22,168 INFO L225 Difference]: With dead ends: 12581 [2025-04-13 23:34:22,168 INFO L226 Difference]: Without dead ends: 12499 [2025-04-13 23:34:22,173 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:34:22,173 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 296 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:22,173 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 105 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:34:22,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12499 states. [2025-04-13 23:34:22,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12499 to 6527. [2025-04-13 23:34:22,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6527 states, 6526 states have (on average 3.6536929206251916) internal successors, (23844), 6526 states have internal predecessors, (23844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:22,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6527 states to 6527 states and 23844 transitions. [2025-04-13 23:34:22,337 INFO L79 Accepts]: Start accepts. Automaton has 6527 states and 23844 transitions. Word has length 54 [2025-04-13 23:34:22,337 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:22,337 INFO L485 AbstractCegarLoop]: Abstraction has 6527 states and 23844 transitions. [2025-04-13 23:34:22,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 23:34:22,337 INFO L278 IsEmpty]: Start isEmpty. Operand 6527 states and 23844 transitions. [2025-04-13 23:34:22,347 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:22,347 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:22,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:34:22,347 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable386 [2025-04-13 23:34:22,347 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 23:34:22,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:22,348 INFO L85 PathProgramCache]: Analyzing trace with hash 919429833, now seen corresponding path program 388 times [2025-04-13 23:34:22,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:22,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660156489] [2025-04-13 23:34:22,348 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:34:22,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:22,350 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:34:22,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 23:34:22,362 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:34:22,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:34:22,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:22,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660156489] [2025-04-13 23:34:22,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660156489] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:22,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:22,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 23:34:22,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855449971] [2025-04-13 23:34:22,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:22,990 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:34:22,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:22,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:34:22,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:34:22,990 INFO L87 Difference]: Start difference. First operand 6527 states and 23844 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:24,319 INFO L93 Difference]: Finished difference Result 13296 states and 46489 transitions. [2025-04-13 23:34:24,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 23:34:24,319 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:24,319 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:24,376 INFO L225 Difference]: With dead ends: 13296 [2025-04-13 23:34:24,377 INFO L226 Difference]: Without dead ends: 13151 [2025-04-13 23:34:24,381 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=314, Invalid=678, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:34:24,381 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 387 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1891 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:24,381 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 144 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1891 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:34:24,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13151 states. [2025-04-13 23:34:24,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13151 to 6484. [2025-04-13 23:34:24,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6484 states, 6483 states have (on average 3.660033934906679) internal successors, (23728), 6483 states have internal predecessors, (23728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:24,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6484 states to 6484 states and 23728 transitions. [2025-04-13 23:34:24,579 INFO L79 Accepts]: Start accepts. Automaton has 6484 states and 23728 transitions. Word has length 54 [2025-04-13 23:34:24,579 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:24,579 INFO L485 AbstractCegarLoop]: Abstraction has 6484 states and 23728 transitions. [2025-04-13 23:34:24,579 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:24,579 INFO L278 IsEmpty]: Start isEmpty. Operand 6484 states and 23728 transitions. [2025-04-13 23:34:24,589 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:24,589 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:24,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:34:24,589 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable387 [2025-04-13 23:34:24,589 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 23:34:24,590 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:24,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2023195481, now seen corresponding path program 389 times [2025-04-13 23:34:24,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:24,590 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618040083] [2025-04-13 23:34:24,590 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:34:24,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:24,593 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:24,603 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:24,603 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:34:24,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:25,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:34:25,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:25,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618040083] [2025-04-13 23:34:25,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618040083] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:25,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:25,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:25,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19504568] [2025-04-13 23:34:25,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:25,166 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:25,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:25,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:25,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:25,167 INFO L87 Difference]: Start difference. First operand 6484 states and 23728 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:25,983 INFO L93 Difference]: Finished difference Result 12504 states and 44517 transitions. [2025-04-13 23:34:25,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:25,983 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:25,983 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:26,039 INFO L225 Difference]: With dead ends: 12504 [2025-04-13 23:34:26,039 INFO L226 Difference]: Without dead ends: 12433 [2025-04-13 23:34:26,043 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:34:26,044 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 291 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:26,044 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 103 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:34:26,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12433 states. [2025-04-13 23:34:26,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12433 to 6517. [2025-04-13 23:34:26,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6517 states, 6516 states have (on average 3.657305095150399) internal successors, (23831), 6516 states have internal predecessors, (23831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:26,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6517 states to 6517 states and 23831 transitions. [2025-04-13 23:34:26,215 INFO L79 Accepts]: Start accepts. Automaton has 6517 states and 23831 transitions. Word has length 54 [2025-04-13 23:34:26,215 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:26,215 INFO L485 AbstractCegarLoop]: Abstraction has 6517 states and 23831 transitions. [2025-04-13 23:34:26,215 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:26,215 INFO L278 IsEmpty]: Start isEmpty. Operand 6517 states and 23831 transitions. [2025-04-13 23:34:26,225 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:26,225 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:26,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 23:34:26,225 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable388 [2025-04-13 23:34:26,225 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 23:34:26,226 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:26,226 INFO L85 PathProgramCache]: Analyzing trace with hash 766222807, now seen corresponding path program 390 times [2025-04-13 23:34:26,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:26,226 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385738802] [2025-04-13 23:34:26,226 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:34:26,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:26,228 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:26,238 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:26,238 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:34:26,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:26,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:34:26,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:26,899 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385738802] [2025-04-13 23:34:26,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385738802] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:26,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:26,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:26,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208557588] [2025-04-13 23:34:26,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:26,899 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:26,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:26,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:26,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:26,900 INFO L87 Difference]: Start difference. First operand 6517 states and 23831 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:27,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:27,790 INFO L93 Difference]: Finished difference Result 11546 states and 40904 transitions. [2025-04-13 23:34:27,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:27,791 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:27,791 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:27,839 INFO L225 Difference]: With dead ends: 11546 [2025-04-13 23:34:27,839 INFO L226 Difference]: Without dead ends: 11478 [2025-04-13 23:34:27,842 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:34:27,843 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 287 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:27,843 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 131 Invalid, 1737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1719 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:34:27,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11478 states. [2025-04-13 23:34:27,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11478 to 6542. [2025-04-13 23:34:27,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6542 states, 6541 states have (on average 3.6563216633542273) internal successors, (23916), 6541 states have internal predecessors, (23916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 23916 transitions. [2025-04-13 23:34:28,005 INFO L79 Accepts]: Start accepts. Automaton has 6542 states and 23916 transitions. Word has length 54 [2025-04-13 23:34:28,006 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:28,006 INFO L485 AbstractCegarLoop]: Abstraction has 6542 states and 23916 transitions. [2025-04-13 23:34:28,006 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:28,006 INFO L278 IsEmpty]: Start isEmpty. Operand 6542 states and 23916 transitions. [2025-04-13 23:34:28,016 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:28,017 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:28,017 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:34:28,017 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable389 [2025-04-13 23:34:28,017 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 23:34:28,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:28,017 INFO L85 PathProgramCache]: Analyzing trace with hash 513874787, now seen corresponding path program 391 times [2025-04-13 23:34:28,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:28,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835135537] [2025-04-13 23:34:28,017 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:34:28,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:28,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:28,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:28,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:34:28,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:28,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 23:34:28,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:28,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835135537] [2025-04-13 23:34:28,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835135537] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:28,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:28,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:28,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794696055] [2025-04-13 23:34:28,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:28,659 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:28,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:28,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:28,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:28,659 INFO L87 Difference]: Start difference. First operand 6542 states and 23916 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:29,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:29,549 INFO L93 Difference]: Finished difference Result 12528 states and 44589 transitions. [2025-04-13 23:34:29,549 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:29,549 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:29,549 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:29,602 INFO L225 Difference]: With dead ends: 12528 [2025-04-13 23:34:29,602 INFO L226 Difference]: Without dead ends: 12447 [2025-04-13 23:34:29,606 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 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 23:34:29,606 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 271 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:29,606 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 115 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:34:29,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12447 states. [2025-04-13 23:34:29,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12447 to 6531. [2025-04-13 23:34:29,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6531 states, 6530 states have (on average 3.6566615620214393) internal successors, (23878), 6530 states have internal predecessors, (23878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:29,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6531 states to 6531 states and 23878 transitions. [2025-04-13 23:34:29,771 INFO L79 Accepts]: Start accepts. Automaton has 6531 states and 23878 transitions. Word has length 54 [2025-04-13 23:34:29,771 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:29,771 INFO L485 AbstractCegarLoop]: Abstraction has 6531 states and 23878 transitions. [2025-04-13 23:34:29,771 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:29,771 INFO L278 IsEmpty]: Start isEmpty. Operand 6531 states and 23878 transitions. [2025-04-13 23:34:29,781 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:29,781 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:29,781 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:34:29,781 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable390 [2025-04-13 23:34:29,781 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 23:34:29,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:29,782 INFO L85 PathProgramCache]: Analyzing trace with hash -33781769, now seen corresponding path program 392 times [2025-04-13 23:34:29,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:29,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329323882] [2025-04-13 23:34:29,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:34:29,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:29,784 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:29,794 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:29,794 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:34:29,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:30,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:34:30,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:30,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329323882] [2025-04-13 23:34:30,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329323882] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:30,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:30,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:30,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350787985] [2025-04-13 23:34:30,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:30,493 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:30,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:30,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:30,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:30,493 INFO L87 Difference]: Start difference. First operand 6531 states and 23878 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:31,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:31,378 INFO L93 Difference]: Finished difference Result 11538 states and 40863 transitions. [2025-04-13 23:34:31,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:31,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 23:34:31,378 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:31,428 INFO L225 Difference]: With dead ends: 11538 [2025-04-13 23:34:31,428 INFO L226 Difference]: Without dead ends: 11457 [2025-04-13 23:34:31,431 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:34:31,432 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 291 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 1686 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:31,432 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 128 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1686 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:34:31,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11457 states. [2025-04-13 23:34:31,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11457 to 6521. [2025-04-13 23:34:31,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6521 states, 6520 states have (on average 3.657668711656442) internal successors, (23848), 6520 states have internal predecessors, (23848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:31,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6521 states to 6521 states and 23848 transitions. [2025-04-13 23:34:31,594 INFO L79 Accepts]: Start accepts. Automaton has 6521 states and 23848 transitions. Word has length 54 [2025-04-13 23:34:31,595 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:31,595 INFO L485 AbstractCegarLoop]: Abstraction has 6521 states and 23848 transitions. [2025-04-13 23:34:31,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 23:34:31,595 INFO L278 IsEmpty]: Start isEmpty. Operand 6521 states and 23848 transitions. [2025-04-13 23:34:31,605 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:31,606 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:31,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 23:34:31,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable391 [2025-04-13 23:34:31,606 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 23:34:31,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:31,606 INFO L85 PathProgramCache]: Analyzing trace with hash 92839539, now seen corresponding path program 393 times [2025-04-13 23:34:31,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:31,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819022111] [2025-04-13 23:34:31,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:34:31,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:31,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:31,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:31,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:34:31,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:34:32,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:32,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819022111] [2025-04-13 23:34:32,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819022111] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:32,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:32,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:32,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610664571] [2025-04-13 23:34:32,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:32,217 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:32,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:32,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:32,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:32,217 INFO L87 Difference]: Start difference. First operand 6521 states and 23848 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:33,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:33,075 INFO L93 Difference]: Finished difference Result 12481 states and 44473 transitions. [2025-04-13 23:34:33,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:33,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 23:34:33,075 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:33,174 INFO L225 Difference]: With dead ends: 12481 [2025-04-13 23:34:33,175 INFO L226 Difference]: Without dead ends: 12345 [2025-04-13 23:34:33,177 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 23:34:33,177 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 270 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:33,177 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 107 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:34:33,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12345 states. [2025-04-13 23:34:33,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12345 to 6499. [2025-04-13 23:34:33,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6499 states, 6498 states have (on average 3.6588180978762694) internal successors, (23775), 6498 states have internal predecessors, (23775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:33,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6499 states to 6499 states and 23775 transitions. [2025-04-13 23:34:33,319 INFO L79 Accepts]: Start accepts. Automaton has 6499 states and 23775 transitions. Word has length 54 [2025-04-13 23:34:33,319 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:33,319 INFO L485 AbstractCegarLoop]: Abstraction has 6499 states and 23775 transitions. [2025-04-13 23:34:33,319 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:33,319 INFO L278 IsEmpty]: Start isEmpty. Operand 6499 states and 23775 transitions. [2025-04-13 23:34:33,329 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:33,329 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:33,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 23:34:33,330 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable392 [2025-04-13 23:34:33,330 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 23:34:33,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:33,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1686798773, now seen corresponding path program 394 times [2025-04-13 23:34:33,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:33,330 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571844676] [2025-04-13 23:34:33,330 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:34:33,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:33,333 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:34:33,343 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 23:34:33,344 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:34:33,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:33,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 23:34:33,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:33,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571844676] [2025-04-13 23:34:33,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571844676] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:33,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:33,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 23:34:33,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690160311] [2025-04-13 23:34:33,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:33,905 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:34:33,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:33,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:34:33,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:34:33,905 INFO L87 Difference]: Start difference. First operand 6499 states and 23775 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:34,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:34,987 INFO L93 Difference]: Finished difference Result 13401 states and 46757 transitions. [2025-04-13 23:34:34,987 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 23:34:34,987 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:34,987 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:35,049 INFO L225 Difference]: With dead ends: 13401 [2025-04-13 23:34:35,049 INFO L226 Difference]: Without dead ends: 13333 [2025-04-13 23:34:35,053 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=267, Invalid=603, Unknown=0, NotChecked=0, Total=870 [2025-04-13 23:34:35,053 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 414 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1926 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:35,054 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 146 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1926 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:34:35,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13333 states. [2025-04-13 23:34:35,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13333 to 6509. [2025-04-13 23:34:35,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6509 states, 6508 states have (on average 3.6570374923171483) internal successors, (23800), 6508 states have internal predecessors, (23800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:35,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6509 states to 6509 states and 23800 transitions. [2025-04-13 23:34:35,214 INFO L79 Accepts]: Start accepts. Automaton has 6509 states and 23800 transitions. Word has length 54 [2025-04-13 23:34:35,214 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:35,214 INFO L485 AbstractCegarLoop]: Abstraction has 6509 states and 23800 transitions. [2025-04-13 23:34:35,214 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:35,214 INFO L278 IsEmpty]: Start isEmpty. Operand 6509 states and 23800 transitions. [2025-04-13 23:34:35,224 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:35,224 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:35,224 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:34:35,224 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable393 [2025-04-13 23:34:35,224 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 23:34:35,224 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:35,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1747848753, now seen corresponding path program 395 times [2025-04-13 23:34:35,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:35,224 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114105590] [2025-04-13 23:34:35,224 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:34:35,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:35,227 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:35,238 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:35,238 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:34:35,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:35,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 23:34:35,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:35,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114105590] [2025-04-13 23:34:35,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114105590] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:35,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:35,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:35,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781067244] [2025-04-13 23:34:35,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:35,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:35,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:35,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:35,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:35,854 INFO L87 Difference]: Start difference. First operand 6509 states and 23800 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:36,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:36,699 INFO L93 Difference]: Finished difference Result 12403 states and 44230 transitions. [2025-04-13 23:34:36,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:36,699 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:36,699 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:36,750 INFO L225 Difference]: With dead ends: 12403 [2025-04-13 23:34:36,750 INFO L226 Difference]: Without dead ends: 12339 [2025-04-13 23:34:36,754 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:34:36,754 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 283 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:36,754 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 107 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1435 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:34:36,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12339 states. [2025-04-13 23:34:36,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12339 to 6533. [2025-04-13 23:34:36,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6533 states, 6532 states have (on average 3.65523576240049) internal successors, (23876), 6532 states have internal predecessors, (23876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6533 states to 6533 states and 23876 transitions. [2025-04-13 23:34:36,911 INFO L79 Accepts]: Start accepts. Automaton has 6533 states and 23876 transitions. Word has length 54 [2025-04-13 23:34:36,911 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:36,911 INFO L485 AbstractCegarLoop]: Abstraction has 6533 states and 23876 transitions. [2025-04-13 23:34:36,911 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:36,912 INFO L278 IsEmpty]: Start isEmpty. Operand 6533 states and 23876 transitions. [2025-04-13 23:34:36,921 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:36,921 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:36,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 23:34:36,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable394 [2025-04-13 23:34:36,922 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 23:34:36,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:36,922 INFO L85 PathProgramCache]: Analyzing trace with hash 916320791, now seen corresponding path program 396 times [2025-04-13 23:34:36,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:36,922 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681095127] [2025-04-13 23:34:36,922 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:34:36,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:36,924 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:36,935 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:36,935 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:34:36,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:37,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 23:34:37,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:37,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681095127] [2025-04-13 23:34:37,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681095127] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:37,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:37,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:37,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188062900] [2025-04-13 23:34:37,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:37,535 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:37,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:37,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:37,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:37,536 INFO L87 Difference]: Start difference. First operand 6533 states and 23876 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:38,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:38,523 INFO L93 Difference]: Finished difference Result 11561 states and 40924 transitions. [2025-04-13 23:34:38,523 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:38,523 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:38,523 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:38,573 INFO L225 Difference]: With dead ends: 11561 [2025-04-13 23:34:38,574 INFO L226 Difference]: Without dead ends: 11481 [2025-04-13 23:34:38,577 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:34:38,577 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 308 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1646 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:38,577 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 125 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1646 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:34:38,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11481 states. [2025-04-13 23:34:38,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11481 to 6523. [2025-04-13 23:34:38,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6523 states, 6522 states have (on average 3.6562404170499847) internal successors, (23846), 6522 states have internal predecessors, (23846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:38,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6523 states to 6523 states and 23846 transitions. [2025-04-13 23:34:38,730 INFO L79 Accepts]: Start accepts. Automaton has 6523 states and 23846 transitions. Word has length 54 [2025-04-13 23:34:38,730 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:38,730 INFO L485 AbstractCegarLoop]: Abstraction has 6523 states and 23846 transitions. [2025-04-13 23:34:38,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 23:34:38,731 INFO L278 IsEmpty]: Start isEmpty. Operand 6523 states and 23846 transitions. [2025-04-13 23:34:38,741 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:38,741 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:38,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 23:34:38,741 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable395 [2025-04-13 23:34:38,741 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 23:34:38,741 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:38,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1742597201, now seen corresponding path program 397 times [2025-04-13 23:34:38,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:38,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880546298] [2025-04-13 23:34:38,741 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:34:38,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:38,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:38,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:38,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:34:38,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:39,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 23:34:39,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:39,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880546298] [2025-04-13 23:34:39,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880546298] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:39,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:39,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:39,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397053476] [2025-04-13 23:34:39,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:39,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:39,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:39,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:39,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:39,378 INFO L87 Difference]: Start difference. First operand 6523 states and 23846 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:40,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:40,243 INFO L93 Difference]: Finished difference Result 12399 states and 44209 transitions. [2025-04-13 23:34:40,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:40,244 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:40,244 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:40,295 INFO L225 Difference]: With dead ends: 12399 [2025-04-13 23:34:40,295 INFO L226 Difference]: Without dead ends: 12321 [2025-04-13 23:34:40,300 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:34:40,300 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 309 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:40,300 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 119 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:34:40,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12321 states. [2025-04-13 23:34:40,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12321 to 6515. [2025-04-13 23:34:40,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6515 states, 6514 states have (on average 3.656432299662266) internal successors, (23818), 6514 states have internal predecessors, (23818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6515 states to 6515 states and 23818 transitions. [2025-04-13 23:34:40,454 INFO L79 Accepts]: Start accepts. Automaton has 6515 states and 23818 transitions. Word has length 54 [2025-04-13 23:34:40,454 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:40,454 INFO L485 AbstractCegarLoop]: Abstraction has 6515 states and 23818 transitions. [2025-04-13 23:34:40,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 23:34:40,454 INFO L278 IsEmpty]: Start isEmpty. Operand 6515 states and 23818 transitions. [2025-04-13 23:34:40,464 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:40,464 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:40,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 23:34:40,464 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable396 [2025-04-13 23:34:40,464 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 23:34:40,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:40,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1851204565, now seen corresponding path program 398 times [2025-04-13 23:34:40,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:40,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929844340] [2025-04-13 23:34:40,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:34:40,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:40,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:40,478 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:40,478 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:34:40,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:41,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 23:34:41,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:41,067 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929844340] [2025-04-13 23:34:41,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929844340] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:41,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:41,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:41,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426327035] [2025-04-13 23:34:41,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:41,068 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:41,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:41,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:41,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:41,068 INFO L87 Difference]: Start difference. First operand 6515 states and 23818 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:42,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:42,084 INFO L93 Difference]: Finished difference Result 11603 states and 41019 transitions. [2025-04-13 23:34:42,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:42,085 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:42,085 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:42,131 INFO L225 Difference]: With dead ends: 11603 [2025-04-13 23:34:42,132 INFO L226 Difference]: Without dead ends: 11532 [2025-04-13 23:34:42,133 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:34:42,133 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 297 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:42,133 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 125 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:34:42,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11532 states. [2025-04-13 23:34:42,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11532 to 6526. [2025-04-13 23:34:42,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6526 states, 6525 states have (on average 3.654406130268199) internal successors, (23845), 6525 states have internal predecessors, (23845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6526 states to 6526 states and 23845 transitions. [2025-04-13 23:34:42,271 INFO L79 Accepts]: Start accepts. Automaton has 6526 states and 23845 transitions. Word has length 54 [2025-04-13 23:34:42,271 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:42,272 INFO L485 AbstractCegarLoop]: Abstraction has 6526 states and 23845 transitions. [2025-04-13 23:34:42,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 23:34:42,272 INFO L278 IsEmpty]: Start isEmpty. Operand 6526 states and 23845 transitions. [2025-04-13 23:34:42,281 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:42,281 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:42,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 23:34:42,282 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable397 [2025-04-13 23:34:42,282 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 23:34:42,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:42,282 INFO L85 PathProgramCache]: Analyzing trace with hash -20638765, now seen corresponding path program 399 times [2025-04-13 23:34:42,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:42,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717032830] [2025-04-13 23:34:42,282 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:34:42,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:42,284 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:42,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:42,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:34:42,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:42,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:34:42,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:42,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717032830] [2025-04-13 23:34:42,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717032830] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:42,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:42,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:42,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225126815] [2025-04-13 23:34:42,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:42,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:42,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:42,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:42,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:42,896 INFO L87 Difference]: Start difference. First operand 6526 states and 23845 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:43,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:43,888 INFO L93 Difference]: Finished difference Result 12332 states and 44030 transitions. [2025-04-13 23:34:43,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:43,888 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:43,888 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:43,943 INFO L225 Difference]: With dead ends: 12332 [2025-04-13 23:34:43,943 INFO L226 Difference]: Without dead ends: 12142 [2025-04-13 23:34:43,947 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:34:43,947 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 233 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:43,947 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 127 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1629 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:34:43,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12142 states. [2025-04-13 23:34:44,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12142 to 6450. [2025-04-13 23:34:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6450 states, 6449 states have (on average 3.6652194138626144) internal successors, (23637), 6449 states have internal predecessors, (23637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:44,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6450 states to 6450 states and 23637 transitions. [2025-04-13 23:34:44,108 INFO L79 Accepts]: Start accepts. Automaton has 6450 states and 23637 transitions. Word has length 54 [2025-04-13 23:34:44,108 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:44,108 INFO L485 AbstractCegarLoop]: Abstraction has 6450 states and 23637 transitions. [2025-04-13 23:34:44,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 23:34:44,108 INFO L278 IsEmpty]: Start isEmpty. Operand 6450 states and 23637 transitions. [2025-04-13 23:34:44,118 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:44,118 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:44,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 23:34:44,118 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable398 [2025-04-13 23:34:44,118 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 23:34:44,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:44,119 INFO L85 PathProgramCache]: Analyzing trace with hash 911069239, now seen corresponding path program 400 times [2025-04-13 23:34:44,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:44,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100073737] [2025-04-13 23:34:44,119 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:34:44,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:44,143 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:34:44,154 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 23:34:44,154 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:34:44,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:44,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:34:44,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:44,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100073737] [2025-04-13 23:34:44,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100073737] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:44,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:44,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:44,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163579711] [2025-04-13 23:34:44,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:44,691 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:44,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:44,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:44,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:44,691 INFO L87 Difference]: Start difference. First operand 6450 states and 23637 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:45,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:45,605 INFO L93 Difference]: Finished difference Result 11478 states and 40685 transitions. [2025-04-13 23:34:45,606 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:45,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 23:34:45,606 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:45,654 INFO L225 Difference]: With dead ends: 11478 [2025-04-13 23:34:45,654 INFO L226 Difference]: Without dead ends: 11392 [2025-04-13 23:34:45,658 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:34:45,658 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 279 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:45,658 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 133 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:34:45,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11392 states. [2025-04-13 23:34:45,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11392 to 6434. [2025-04-13 23:34:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6434 states, 6433 states have (on average 3.6678066221047723) internal successors, (23595), 6433 states have internal predecessors, (23595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6434 states to 6434 states and 23595 transitions. [2025-04-13 23:34:45,815 INFO L79 Accepts]: Start accepts. Automaton has 6434 states and 23595 transitions. Word has length 54 [2025-04-13 23:34:45,815 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:45,815 INFO L485 AbstractCegarLoop]: Abstraction has 6434 states and 23595 transitions. [2025-04-13 23:34:45,815 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:45,815 INFO L278 IsEmpty]: Start isEmpty. Operand 6434 states and 23595 transitions. [2025-04-13 23:34:45,825 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:45,825 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:45,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:34:45,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable399 [2025-04-13 23:34:45,825 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 23:34:45,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:45,826 INFO L85 PathProgramCache]: Analyzing trace with hash -209008901, now seen corresponding path program 401 times [2025-04-13 23:34:45,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:45,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777969594] [2025-04-13 23:34:45,826 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:34:45,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:45,828 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:45,839 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:45,839 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:34:45,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:34:46,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:46,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777969594] [2025-04-13 23:34:46,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777969594] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:46,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:46,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:46,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957334900] [2025-04-13 23:34:46,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:46,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:46,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:46,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:46,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:46,500 INFO L87 Difference]: Start difference. First operand 6434 states and 23595 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:47,407 INFO L93 Difference]: Finished difference Result 13118 states and 46543 transitions. [2025-04-13 23:34:47,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:47,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 23:34:47,407 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:47,462 INFO L225 Difference]: With dead ends: 13118 [2025-04-13 23:34:47,462 INFO L226 Difference]: Without dead ends: 13047 [2025-04-13 23:34:47,467 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:34:47,467 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 378 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1601 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:47,467 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 115 Invalid, 1626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1601 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:34:47,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13047 states. [2025-04-13 23:34:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13047 to 6490. [2025-04-13 23:34:47,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6490 states, 6489 states have (on average 3.6675913083680074) internal successors, (23799), 6489 states have internal predecessors, (23799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:47,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6490 states to 6490 states and 23799 transitions. [2025-04-13 23:34:47,639 INFO L79 Accepts]: Start accepts. Automaton has 6490 states and 23799 transitions. Word has length 54 [2025-04-13 23:34:47,639 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:47,639 INFO L485 AbstractCegarLoop]: Abstraction has 6490 states and 23799 transitions. [2025-04-13 23:34:47,639 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:47,639 INFO L278 IsEmpty]: Start isEmpty. Operand 6490 states and 23799 transitions. [2025-04-13 23:34:47,650 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:47,650 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:47,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:34:47,650 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable400 [2025-04-13 23:34:47,650 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 23:34:47,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:47,650 INFO L85 PathProgramCache]: Analyzing trace with hash 167759975, now seen corresponding path program 402 times [2025-04-13 23:34:47,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:47,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647599754] [2025-04-13 23:34:47,650 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:34:47,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:47,653 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:47,664 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:47,664 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:34:47,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:48,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 23:34:48,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:48,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647599754] [2025-04-13 23:34:48,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647599754] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:48,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:48,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:48,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813197526] [2025-04-13 23:34:48,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:48,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:48,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:48,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:48,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:48,269 INFO L87 Difference]: Start difference. First operand 6490 states and 23799 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:49,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:49,336 INFO L93 Difference]: Finished difference Result 11392 states and 40499 transitions. [2025-04-13 23:34:49,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:49,336 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:49,336 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:49,380 INFO L225 Difference]: With dead ends: 11392 [2025-04-13 23:34:49,381 INFO L226 Difference]: Without dead ends: 11324 [2025-04-13 23:34:49,384 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:34:49,384 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 278 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 1737 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:49,384 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 130 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1737 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:34:49,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11324 states. [2025-04-13 23:34:49,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11324 to 6520. [2025-04-13 23:34:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6520 states, 6519 states have (on average 3.6652860868231323) internal successors, (23894), 6519 states have internal predecessors, (23894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:49,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6520 states to 6520 states and 23894 transitions. [2025-04-13 23:34:49,539 INFO L79 Accepts]: Start accepts. Automaton has 6520 states and 23894 transitions. Word has length 54 [2025-04-13 23:34:49,539 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:49,539 INFO L485 AbstractCegarLoop]: Abstraction has 6520 states and 23894 transitions. [2025-04-13 23:34:49,539 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:49,540 INFO L278 IsEmpty]: Start isEmpty. Operand 6520 states and 23894 transitions. [2025-04-13 23:34:49,549 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:49,550 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:49,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 23:34:49,550 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable401 [2025-04-13 23:34:49,550 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 23:34:49,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:49,550 INFO L85 PathProgramCache]: Analyzing trace with hash 590995675, now seen corresponding path program 403 times [2025-04-13 23:34:49,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:49,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530277028] [2025-04-13 23:34:49,550 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:34:49,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:49,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:49,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:49,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:34:49,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:50,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 23:34:50,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:50,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530277028] [2025-04-13 23:34:50,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530277028] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:50,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:50,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:50,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671604307] [2025-04-13 23:34:50,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:50,158 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:50,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:50,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:50,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:50,158 INFO L87 Difference]: Start difference. First operand 6520 states and 23894 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:51,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:51,115 INFO L93 Difference]: Finished difference Result 13077 states and 46448 transitions. [2025-04-13 23:34:51,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:51,115 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:51,115 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:51,173 INFO L225 Difference]: With dead ends: 13077 [2025-04-13 23:34:51,173 INFO L226 Difference]: Without dead ends: 12999 [2025-04-13 23:34:51,176 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:34:51,176 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 354 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:51,176 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 115 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:34:51,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12999 states. [2025-04-13 23:34:51,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12999 to 6510. [2025-04-13 23:34:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6510 states, 6509 states have (on average 3.66554002150868) internal successors, (23859), 6509 states have internal predecessors, (23859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:51,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6510 states to 6510 states and 23859 transitions. [2025-04-13 23:34:51,338 INFO L79 Accepts]: Start accepts. Automaton has 6510 states and 23859 transitions. Word has length 54 [2025-04-13 23:34:51,338 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:51,338 INFO L485 AbstractCegarLoop]: Abstraction has 6510 states and 23859 transitions. [2025-04-13 23:34:51,338 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:51,338 INFO L278 IsEmpty]: Start isEmpty. Operand 6510 states and 23859 transitions. [2025-04-13 23:34:51,348 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:51,348 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:51,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:34:51,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable402 [2025-04-13 23:34:51,348 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 23:34:51,349 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:51,349 INFO L85 PathProgramCache]: Analyzing trace with hash -602718007, now seen corresponding path program 404 times [2025-04-13 23:34:51,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:51,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536986555] [2025-04-13 23:34:51,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:34:51,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:51,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:51,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:51,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:34:51,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:51,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:34:51,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:51,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536986555] [2025-04-13 23:34:51,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536986555] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:51,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:51,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:51,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342611536] [2025-04-13 23:34:51,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:51,931 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:51,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:51,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:51,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:51,932 INFO L87 Difference]: Start difference. First operand 6510 states and 23859 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:52,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:52,882 INFO L93 Difference]: Finished difference Result 11384 states and 40459 transitions. [2025-04-13 23:34:52,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:52,882 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:52,883 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:52,937 INFO L225 Difference]: With dead ends: 11384 [2025-04-13 23:34:52,938 INFO L226 Difference]: Without dead ends: 11304 [2025-04-13 23:34:52,942 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:34:52,942 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 297 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:52,942 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 120 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:34:52,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11304 states. [2025-04-13 23:34:53,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11304 to 6500. [2025-04-13 23:34:53,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6500 states, 6499 states have (on average 3.6657947376519466) internal successors, (23824), 6499 states have internal predecessors, (23824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:53,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6500 states to 6500 states and 23824 transitions. [2025-04-13 23:34:53,106 INFO L79 Accepts]: Start accepts. Automaton has 6500 states and 23824 transitions. Word has length 54 [2025-04-13 23:34:53,107 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:53,107 INFO L485 AbstractCegarLoop]: Abstraction has 6500 states and 23824 transitions. [2025-04-13 23:34:53,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 23:34:53,107 INFO L278 IsEmpty]: Start isEmpty. Operand 6500 states and 23824 transitions. [2025-04-13 23:34:53,117 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:53,117 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:53,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 23:34:53,117 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable403 [2025-04-13 23:34:53,117 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 23:34:53,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:53,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1505355517, now seen corresponding path program 405 times [2025-04-13 23:34:53,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:53,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449153304] [2025-04-13 23:34:53,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:34:53,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:53,120 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:53,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:53,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:34:53,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:34:53,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:53,811 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449153304] [2025-04-13 23:34:53,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449153304] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:53,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:53,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:53,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693539273] [2025-04-13 23:34:53,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:53,812 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:53,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:53,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:53,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:53,812 INFO L87 Difference]: Start difference. First operand 6500 states and 23824 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:54,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:54,775 INFO L93 Difference]: Finished difference Result 13106 states and 46519 transitions. [2025-04-13 23:34:54,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:54,776 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:54,776 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:54,827 INFO L225 Difference]: With dead ends: 13106 [2025-04-13 23:34:54,828 INFO L226 Difference]: Without dead ends: 12969 [2025-04-13 23:34:54,832 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:34:54,832 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 295 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:54,832 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 133 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1775 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:34:54,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12969 states. [2025-04-13 23:34:54,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12969 to 6480. [2025-04-13 23:34:54,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6480 states, 6479 states have (on average 3.666615218397901) internal successors, (23756), 6479 states have internal predecessors, (23756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:54,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6480 states to 6480 states and 23756 transitions. [2025-04-13 23:34:54,987 INFO L79 Accepts]: Start accepts. Automaton has 6480 states and 23756 transitions. Word has length 54 [2025-04-13 23:34:54,987 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:54,987 INFO L485 AbstractCegarLoop]: Abstraction has 6480 states and 23756 transitions. [2025-04-13 23:34:54,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 23:34:54,987 INFO L278 IsEmpty]: Start isEmpty. Operand 6480 states and 23756 transitions. [2025-04-13 23:34:54,997 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:54,997 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:54,997 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:34:54,997 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable404 [2025-04-13 23:34:54,997 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 23:34:54,997 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:54,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1005597175, now seen corresponding path program 406 times [2025-04-13 23:34:54,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:54,997 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197318710] [2025-04-13 23:34:54,997 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:34:54,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:55,000 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:34:55,010 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 23:34:55,010 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:34:55,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:34:55,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:55,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197318710] [2025-04-13 23:34:55,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197318710] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:55,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:55,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 23:34:55,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55575151] [2025-04-13 23:34:55,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:55,621 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:34:55,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:55,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:34:55,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:34:55,622 INFO L87 Difference]: Start difference. First operand 6480 states and 23756 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:56,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:56,731 INFO L93 Difference]: Finished difference Result 13146 states and 46099 transitions. [2025-04-13 23:34:56,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:34:56,731 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:34:56,731 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:56,787 INFO L225 Difference]: With dead ends: 13146 [2025-04-13 23:34:56,787 INFO L226 Difference]: Without dead ends: 13012 [2025-04-13 23:34:56,792 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=266, Invalid=604, Unknown=0, NotChecked=0, Total=870 [2025-04-13 23:34:56,792 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 343 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 1989 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 2019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:56,792 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 154 Invalid, 2019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1989 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:34:56,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13012 states. [2025-04-13 23:34:56,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13012 to 6460. [2025-04-13 23:34:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6460 states, 6459 states have (on average 3.667131134850596) internal successors, (23686), 6459 states have internal predecessors, (23686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:56,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6460 states to 6460 states and 23686 transitions. [2025-04-13 23:34:56,960 INFO L79 Accepts]: Start accepts. Automaton has 6460 states and 23686 transitions. Word has length 54 [2025-04-13 23:34:56,960 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:56,960 INFO L485 AbstractCegarLoop]: Abstraction has 6460 states and 23686 transitions. [2025-04-13 23:34:56,960 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:56,960 INFO L278 IsEmpty]: Start isEmpty. Operand 6460 states and 23686 transitions. [2025-04-13 23:34:56,970 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:56,970 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:56,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 23:34:56,970 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable405 [2025-04-13 23:34:56,970 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 23:34:56,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:56,970 INFO L85 PathProgramCache]: Analyzing trace with hash -775785001, now seen corresponding path program 407 times [2025-04-13 23:34:56,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:56,970 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178993231] [2025-04-13 23:34:56,970 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:34:56,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:56,973 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:56,983 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:56,983 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:34:56,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:57,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:34:57,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:57,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178993231] [2025-04-13 23:34:57,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178993231] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:57,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:57,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:57,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332528150] [2025-04-13 23:34:57,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:57,625 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:57,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:57,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:57,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:57,625 INFO L87 Difference]: Start difference. First operand 6460 states and 23686 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:34:58,557 INFO L93 Difference]: Finished difference Result 13088 states and 46441 transitions. [2025-04-13 23:34:58,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:34:58,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 23:34:58,557 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:34:58,613 INFO L225 Difference]: With dead ends: 13088 [2025-04-13 23:34:58,613 INFO L226 Difference]: Without dead ends: 13017 [2025-04-13 23:34:58,618 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:34:58,618 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 336 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1628 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:34:58,618 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 119 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1628 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:34:58,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13017 states. [2025-04-13 23:34:58,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13017 to 6474. [2025-04-13 23:34:58,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6474 states, 6473 states have (on average 3.6655337556001855) internal successors, (23727), 6473 states have internal predecessors, (23727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:34:58,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6474 states to 6474 states and 23727 transitions. [2025-04-13 23:34:58,789 INFO L79 Accepts]: Start accepts. Automaton has 6474 states and 23727 transitions. Word has length 54 [2025-04-13 23:34:58,790 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:34:58,790 INFO L485 AbstractCegarLoop]: Abstraction has 6474 states and 23727 transitions. [2025-04-13 23:34:58,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 23:34:58,790 INFO L278 IsEmpty]: Start isEmpty. Operand 6474 states and 23727 transitions. [2025-04-13 23:34:58,800 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:34:58,800 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:34:58,800 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:34:58,800 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable406 [2025-04-13 23:34:58,800 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 23:34:58,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:34:58,800 INFO L85 PathProgramCache]: Analyzing trace with hash 169367655, now seen corresponding path program 408 times [2025-04-13 23:34:58,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:34:58,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133831525] [2025-04-13 23:34:58,800 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:34:58,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:34:58,803 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:34:58,813 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:34:58,813 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:34:58,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:34:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:34:59,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:34:59,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133831525] [2025-04-13 23:34:59,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133831525] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:34:59,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:34:59,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:34:59,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269097274] [2025-04-13 23:34:59,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:34:59,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:34:59,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:34:59,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:34:59,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:34:59,398 INFO L87 Difference]: Start difference. First operand 6474 states and 23727 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:00,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:00,511 INFO L93 Difference]: Finished difference Result 11426 states and 40573 transitions. [2025-04-13 23:35:00,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:00,512 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:35:00,512 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:00,561 INFO L225 Difference]: With dead ends: 11426 [2025-04-13 23:35:00,561 INFO L226 Difference]: Without dead ends: 11355 [2025-04-13 23:35:00,566 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:35:00,566 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 260 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:00,566 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 130 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:35:00,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11355 states. [2025-04-13 23:35:00,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11355 to 6507. [2025-04-13 23:35:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6507 states, 6506 states have (on average 3.6627728250845375) internal successors, (23830), 6506 states have internal predecessors, (23830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6507 states to 6507 states and 23830 transitions. [2025-04-13 23:35:00,723 INFO L79 Accepts]: Start accepts. Automaton has 6507 states and 23830 transitions. Word has length 54 [2025-04-13 23:35:00,723 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:00,723 INFO L485 AbstractCegarLoop]: Abstraction has 6507 states and 23830 transitions. [2025-04-13 23:35:00,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 23:35:00,723 INFO L278 IsEmpty]: Start isEmpty. Operand 6507 states and 23830 transitions. [2025-04-13 23:35:00,733 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:00,733 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:00,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:35:00,733 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable407 [2025-04-13 23:35:00,733 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 23:35:00,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:00,733 INFO L85 PathProgramCache]: Analyzing trace with hash 24219575, now seen corresponding path program 409 times [2025-04-13 23:35:00,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:00,733 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047408717] [2025-04-13 23:35:00,733 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:35:00,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:00,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:00,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:00,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:35:00,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:01,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:01,326 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047408717] [2025-04-13 23:35:01,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047408717] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:01,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:01,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:01,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938396656] [2025-04-13 23:35:01,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:01,326 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:01,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:01,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:01,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:01,326 INFO L87 Difference]: Start difference. First operand 6507 states and 23830 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:02,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:02,299 INFO L93 Difference]: Finished difference Result 13118 states and 46527 transitions. [2025-04-13 23:35:02,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35: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 23:35:02,299 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:02,357 INFO L225 Difference]: With dead ends: 13118 [2025-04-13 23:35:02,357 INFO L226 Difference]: Without dead ends: 13040 [2025-04-13 23:35:02,361 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:35:02,362 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 286 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 1802 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:02,362 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 137 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1802 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:35:02,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13040 states. [2025-04-13 23:35:02,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13040 to 6497. [2025-04-13 23:35:02,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6497 states, 6496 states have (on average 3.6639470443349755) internal successors, (23801), 6496 states have internal predecessors, (23801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6497 states to 6497 states and 23801 transitions. [2025-04-13 23:35:02,560 INFO L79 Accepts]: Start accepts. Automaton has 6497 states and 23801 transitions. Word has length 54 [2025-04-13 23:35:02,560 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:02,560 INFO L485 AbstractCegarLoop]: Abstraction has 6497 states and 23801 transitions. [2025-04-13 23:35:02,560 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:02,560 INFO L278 IsEmpty]: Start isEmpty. Operand 6497 states and 23801 transitions. [2025-04-13 23:35:02,570 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:02,570 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:02,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:35:02,571 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable408 [2025-04-13 23:35:02,571 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 23:35:02,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:02,571 INFO L85 PathProgramCache]: Analyzing trace with hash -770767671, now seen corresponding path program 410 times [2025-04-13 23:35:02,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:02,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051332493] [2025-04-13 23:35:02,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:35:02,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:02,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:02,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:02,585 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:35:02,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:03,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:03,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051332493] [2025-04-13 23:35:03,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051332493] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:03,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:03,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:03,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571902902] [2025-04-13 23:35:03,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:03,166 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:03,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:03,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:03,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:03,166 INFO L87 Difference]: Start difference. First operand 6497 states and 23801 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:04,124 INFO L93 Difference]: Finished difference Result 11415 states and 40531 transitions. [2025-04-13 23:35:04,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:04,124 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:35:04,125 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:04,177 INFO L225 Difference]: With dead ends: 11415 [2025-04-13 23:35:04,177 INFO L226 Difference]: Without dead ends: 11334 [2025-04-13 23:35:04,181 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:35:04,181 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 268 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:04,181 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 127 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1675 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:35:04,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11334 states. [2025-04-13 23:35:04,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11334 to 6486. [2025-04-13 23:35:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6486 states, 6485 states have (on average 3.664302235929067) internal successors, (23763), 6485 states have internal predecessors, (23763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:04,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6486 states to 6486 states and 23763 transitions. [2025-04-13 23:35:04,339 INFO L79 Accepts]: Start accepts. Automaton has 6486 states and 23763 transitions. Word has length 54 [2025-04-13 23:35:04,339 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:04,339 INFO L485 AbstractCegarLoop]: Abstraction has 6486 states and 23763 transitions. [2025-04-13 23:35:04,340 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:04,340 INFO L278 IsEmpty]: Start isEmpty. Operand 6486 states and 23763 transitions. [2025-04-13 23:35:04,350 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:04,350 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:04,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 23:35:04,350 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable409 [2025-04-13 23:35:04,350 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 23:35:04,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:04,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1870730207, now seen corresponding path program 411 times [2025-04-13 23:35:04,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:04,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644321645] [2025-04-13 23:35:04,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:35:04,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:04,353 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:04,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:04,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:35:04,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:04,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:04,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:04,991 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644321645] [2025-04-13 23:35:04,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644321645] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:04,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:04,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:04,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319950735] [2025-04-13 23:35:04,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:04,991 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:04,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:04,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:04,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:04,992 INFO L87 Difference]: Start difference. First operand 6486 states and 23763 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:05,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:05,919 INFO L93 Difference]: Finished difference Result 13104 states and 46483 transitions. [2025-04-13 23:35:05,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:05,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 23:35:05,920 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:05,974 INFO L225 Difference]: With dead ends: 13104 [2025-04-13 23:35:05,974 INFO L226 Difference]: Without dead ends: 13033 [2025-04-13 23:35:05,978 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:35:05,978 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 321 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:05,978 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 129 Invalid, 1766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1744 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:35:05,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13033 states. [2025-04-13 23:35:06,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13033 to 6494. [2025-04-13 23:35:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6494 states, 6493 states have (on average 3.662867703680887) internal successors, (23783), 6493 states have internal predecessors, (23783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6494 states to 6494 states and 23783 transitions. [2025-04-13 23:35:06,153 INFO L79 Accepts]: Start accepts. Automaton has 6494 states and 23783 transitions. Word has length 54 [2025-04-13 23:35:06,153 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:06,153 INFO L485 AbstractCegarLoop]: Abstraction has 6494 states and 23783 transitions. [2025-04-13 23:35:06,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 23:35:06,153 INFO L278 IsEmpty]: Start isEmpty. Operand 6494 states and 23783 transitions. [2025-04-13 23:35:06,163 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:06,164 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:06,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:35:06,164 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable410 [2025-04-13 23:35:06,164 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 23:35:06,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:06,164 INFO L85 PathProgramCache]: Analyzing trace with hash 842799063, now seen corresponding path program 412 times [2025-04-13 23:35:06,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:06,164 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361299227] [2025-04-13 23:35:06,164 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:35:06,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:06,167 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:35:06,177 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 23:35:06,177 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:35:06,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:06,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:06,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:06,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361299227] [2025-04-13 23:35:06,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361299227] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:06,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:06,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 23:35:06,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865939308] [2025-04-13 23:35:06,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:06,789 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:35:06,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:06,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:35:06,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:35:06,789 INFO L87 Difference]: Start difference. First operand 6494 states and 23783 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:07,767 INFO L93 Difference]: Finished difference Result 13160 states and 46126 transitions. [2025-04-13 23:35:07,767 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:35:07,767 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:35:07,767 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:07,819 INFO L225 Difference]: With dead ends: 13160 [2025-04-13 23:35:07,819 INFO L226 Difference]: Without dead ends: 13014 [2025-04-13 23:35:07,824 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=271, Invalid=599, Unknown=0, NotChecked=0, Total=870 [2025-04-13 23:35:07,824 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 379 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:07,824 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 121 Invalid, 1687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:35:07,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13014 states. [2025-04-13 23:35:07,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13014 to 6462. [2025-04-13 23:35:07,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6462 states, 6461 states have (on average 3.6655316514471443) internal successors, (23683), 6461 states have internal predecessors, (23683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6462 states to 6462 states and 23683 transitions. [2025-04-13 23:35:07,996 INFO L79 Accepts]: Start accepts. Automaton has 6462 states and 23683 transitions. Word has length 54 [2025-04-13 23:35:07,996 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:07,996 INFO L485 AbstractCegarLoop]: Abstraction has 6462 states and 23683 transitions. [2025-04-13 23:35:07,996 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:07,997 INFO L278 IsEmpty]: Start isEmpty. Operand 6462 states and 23683 transitions. [2025-04-13 23:35:08,007 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:08,007 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:08,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:35:08,007 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable411 [2025-04-13 23:35:08,007 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 23:35:08,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:08,007 INFO L85 PathProgramCache]: Analyzing trace with hash -702156105, now seen corresponding path program 413 times [2025-04-13 23:35:08,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:08,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153573575] [2025-04-13 23:35:08,008 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:35:08,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:08,010 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:08,023 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:08,023 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:35:08,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:08,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:08,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:08,618 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153573575] [2025-04-13 23:35:08,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153573575] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:08,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:08,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:08,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888592090] [2025-04-13 23:35:08,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:08,619 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:08,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:08,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:08,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:08,619 INFO L87 Difference]: Start difference. First operand 6462 states and 23683 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:09,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:09,604 INFO L93 Difference]: Finished difference Result 13065 states and 46356 transitions. [2025-04-13 23:35:09,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:09,604 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:35:09,604 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:09,659 INFO L225 Difference]: With dead ends: 13065 [2025-04-13 23:35:09,659 INFO L226 Difference]: Without dead ends: 12993 [2025-04-13 23:35:09,665 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:35:09,666 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 268 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 1814 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:09,666 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 137 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1814 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:35:09,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12993 states. [2025-04-13 23:35:09,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12993 to 6454. [2025-04-13 23:35:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6454 states, 6453 states have (on average 3.66635673330234) internal successors, (23659), 6453 states have internal predecessors, (23659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6454 states to 6454 states and 23659 transitions. [2025-04-13 23:35:09,837 INFO L79 Accepts]: Start accepts. Automaton has 6454 states and 23659 transitions. Word has length 54 [2025-04-13 23:35:09,837 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:09,837 INFO L485 AbstractCegarLoop]: Abstraction has 6454 states and 23659 transitions. [2025-04-13 23:35:09,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 23:35:09,837 INFO L278 IsEmpty]: Start isEmpty. Operand 6454 states and 23659 transitions. [2025-04-13 23:35:09,847 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:09,847 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35: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 23:35:09,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable412 [2025-04-13 23:35:09,847 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 23:35:09,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:09,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1597671305, now seen corresponding path program 414 times [2025-04-13 23:35:09,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:09,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799019021] [2025-04-13 23:35:09,848 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:35:09,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:09,850 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:09,861 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:09,861 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:35:09,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:10,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:10,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799019021] [2025-04-13 23:35:10,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799019021] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:10,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:10,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:10,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471291356] [2025-04-13 23:35:10,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:10,498 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:10,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:10,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:10,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:10,498 INFO L87 Difference]: Start difference. First operand 6454 states and 23659 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:11,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:11,459 INFO L93 Difference]: Finished difference Result 11215 states and 39953 transitions. [2025-04-13 23:35:11,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:11,459 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:35:11,459 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:11,509 INFO L225 Difference]: With dead ends: 11215 [2025-04-13 23:35:11,509 INFO L226 Difference]: Without dead ends: 11098 [2025-04-13 23:35:11,513 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 23:35:11,513 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 240 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:11,513 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 135 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:35:11,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11098 states. [2025-04-13 23:35:11,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11098 to 6553. [2025-04-13 23:35:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6553 states, 6552 states have (on average 3.6564407814407813) internal successors, (23957), 6552 states have internal predecessors, (23957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:11,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6553 states to 6553 states and 23957 transitions. [2025-04-13 23:35:11,699 INFO L79 Accepts]: Start accepts. Automaton has 6553 states and 23957 transitions. Word has length 54 [2025-04-13 23:35:11,700 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:11,700 INFO L485 AbstractCegarLoop]: Abstraction has 6553 states and 23957 transitions. [2025-04-13 23:35:11,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 23:35:11,700 INFO L278 IsEmpty]: Start isEmpty. Operand 6553 states and 23957 transitions. [2025-04-13 23:35:11,710 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:11,710 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:11,710 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:35:11,710 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable413 [2025-04-13 23:35:11,710 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 23:35:11,710 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:11,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1869122527, now seen corresponding path program 415 times [2025-04-13 23:35:11,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:11,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125447018] [2025-04-13 23:35:11,711 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:35:11,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:11,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:11,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:11,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:35:11,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:12,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:12,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:12,322 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125447018] [2025-04-13 23:35:12,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125447018] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:12,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:12,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:12,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111827295] [2025-04-13 23:35:12,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:12,322 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:12,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:12,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:12,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:12,323 INFO L87 Difference]: Start difference. First operand 6553 states and 23957 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:13,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:13,210 INFO L93 Difference]: Finished difference Result 13073 states and 46414 transitions. [2025-04-13 23:35:13,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:13,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 23:35:13,210 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:13,268 INFO L225 Difference]: With dead ends: 13073 [2025-04-13 23:35:13,268 INFO L226 Difference]: Without dead ends: 13005 [2025-04-13 23:35:13,273 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:35:13,273 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 291 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:13,273 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 121 Invalid, 1638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:35:13,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13005 states. [2025-04-13 23:35:13,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13005 to 6561. [2025-04-13 23:35:13,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6561 states, 6560 states have (on average 3.6550304878048783) internal successors, (23977), 6560 states have internal predecessors, (23977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6561 states to 6561 states and 23977 transitions. [2025-04-13 23:35:13,452 INFO L79 Accepts]: Start accepts. Automaton has 6561 states and 23977 transitions. Word has length 54 [2025-04-13 23:35:13,452 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:13,452 INFO L485 AbstractCegarLoop]: Abstraction has 6561 states and 23977 transitions. [2025-04-13 23:35:13,452 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:13,452 INFO L278 IsEmpty]: Start isEmpty. Operand 6561 states and 23977 transitions. [2025-04-13 23:35:13,463 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:13,463 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:13,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:35:13,463 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable414 [2025-04-13 23:35:13,463 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 23:35:13,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:13,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1262228501, now seen corresponding path program 416 times [2025-04-13 23:35:13,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:13,463 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800351348] [2025-04-13 23:35:13,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:35:13,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:13,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:13,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:13,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:35:13,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:14,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:14,121 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800351348] [2025-04-13 23:35:14,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800351348] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:14,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:14,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:14,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438291718] [2025-04-13 23:35:14,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:14,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:14,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:14,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:14,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:14,122 INFO L87 Difference]: Start difference. First operand 6561 states and 23977 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:15,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:15,018 INFO L93 Difference]: Finished difference Result 11258 states and 40033 transitions. [2025-04-13 23:35:15,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:15,018 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:35:15,018 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:15,066 INFO L225 Difference]: With dead ends: 11258 [2025-04-13 23:35:15,067 INFO L226 Difference]: Without dead ends: 11187 [2025-04-13 23:35:15,070 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 23:35:15,070 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 278 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1503 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:15,071 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 108 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1503 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:35:15,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11187 states. [2025-04-13 23:35:15,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11187 to 6572. [2025-04-13 23:35:15,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6572 states, 6571 states have (on average 3.6530208491858165) internal successors, (24004), 6571 states have internal predecessors, (24004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:15,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6572 states to 6572 states and 24004 transitions. [2025-04-13 23:35:15,228 INFO L79 Accepts]: Start accepts. Automaton has 6572 states and 24004 transitions. Word has length 54 [2025-04-13 23:35:15,228 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:15,228 INFO L485 AbstractCegarLoop]: Abstraction has 6572 states and 24004 transitions. [2025-04-13 23:35:15,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:15,228 INFO L278 IsEmpty]: Start isEmpty. Operand 6572 states and 24004 transitions. [2025-04-13 23:35:15,238 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:15,238 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:15,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:35:15,238 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable415 [2025-04-13 23:35:15,239 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 23:35:15,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:15,239 INFO L85 PathProgramCache]: Analyzing trace with hash -539357993, now seen corresponding path program 417 times [2025-04-13 23:35:15,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:15,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737618273] [2025-04-13 23:35:15,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:35:15,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:15,241 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:15,251 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:15,251 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:35:15,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:15,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 23:35:15,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:15,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737618273] [2025-04-13 23:35:15,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737618273] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:15,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:15,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:15,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660022182] [2025-04-13 23:35:15,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:15,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:15,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:15,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:15,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:15,854 INFO L87 Difference]: Start difference. First operand 6572 states and 24004 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:16,755 INFO L93 Difference]: Finished difference Result 13080 states and 46421 transitions. [2025-04-13 23:35:16,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:16,755 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:35:16,755 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:16,807 INFO L225 Difference]: With dead ends: 13080 [2025-04-13 23:35:16,807 INFO L226 Difference]: Without dead ends: 13004 [2025-04-13 23:35:16,811 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:35:16,811 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 288 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1660 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:16,811 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 122 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1660 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:35:16,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13004 states. [2025-04-13 23:35:16,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13004 to 6560. [2025-04-13 23:35:16,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6560 states, 6559 states have (on average 3.6548254307059005) internal successors, (23972), 6559 states have internal predecessors, (23972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:16,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6560 states to 6560 states and 23972 transitions. [2025-04-13 23:35:16,964 INFO L79 Accepts]: Start accepts. Automaton has 6560 states and 23972 transitions. Word has length 54 [2025-04-13 23:35:16,964 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:16,964 INFO L485 AbstractCegarLoop]: Abstraction has 6560 states and 23972 transitions. [2025-04-13 23:35:16,964 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:16,964 INFO L278 IsEmpty]: Start isEmpty. Operand 6560 states and 23972 transitions. [2025-04-13 23:35:16,973 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:16,973 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:16,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:35:16,974 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable416 [2025-04-13 23:35:16,974 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 23:35:16,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:16,974 INFO L85 PathProgramCache]: Analyzing trace with hash 322093175, now seen corresponding path program 418 times [2025-04-13 23:35:16,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:16,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242922086] [2025-04-13 23:35:16,974 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:35:16,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:16,976 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:35:16,990 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 23:35:16,990 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:35:16,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:17,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:17,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242922086] [2025-04-13 23:35:17,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242922086] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:17,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:17,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:17,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412718010] [2025-04-13 23:35:17,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:17,531 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:17,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:17,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:17,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:17,531 INFO L87 Difference]: Start difference. First operand 6560 states and 23972 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:18,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:18,362 INFO L93 Difference]: Finished difference Result 11175 states and 39810 transitions. [2025-04-13 23:35:18,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:18,363 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:35:18,363 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:18,411 INFO L225 Difference]: With dead ends: 11175 [2025-04-13 23:35:18,411 INFO L226 Difference]: Without dead ends: 11072 [2025-04-13 23:35:18,415 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:35:18,415 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 266 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:18,415 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 100 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:35:18,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11072 states. [2025-04-13 23:35:18,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11072 to 6527. [2025-04-13 23:35:18,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6527 states, 6526 states have (on average 3.6575237511492493) internal successors, (23869), 6526 states have internal predecessors, (23869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6527 states to 6527 states and 23869 transitions. [2025-04-13 23:35:18,569 INFO L79 Accepts]: Start accepts. Automaton has 6527 states and 23869 transitions. Word has length 54 [2025-04-13 23:35:18,569 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:18,569 INFO L485 AbstractCegarLoop]: Abstraction has 6527 states and 23869 transitions. [2025-04-13 23:35:18,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 23:35:18,569 INFO L278 IsEmpty]: Start isEmpty. Operand 6527 states and 23869 transitions. [2025-04-13 23:35:18,579 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:18,579 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:18,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 23:35:18,579 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable417 [2025-04-13 23:35:18,579 INFO L403 AbstractCegarLoop]: === Iteration 419 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:35:18,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:18,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1955292759, now seen corresponding path program 419 times [2025-04-13 23:35:18,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:18,580 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233337279] [2025-04-13 23:35:18,580 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:35:18,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:18,582 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:18,593 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:18,593 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:35:18,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:19,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:19,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233337279] [2025-04-13 23:35:19,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233337279] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:19,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:19,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:19,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272127921] [2025-04-13 23:35:19,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:19,212 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:19,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:19,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:19,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:19,212 INFO L87 Difference]: Start difference. First operand 6527 states and 23869 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:20,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:20,124 INFO L93 Difference]: Finished difference Result 13143 states and 46601 transitions. [2025-04-13 23:35:20,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:20,124 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:35:20,124 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:20,179 INFO L225 Difference]: With dead ends: 13143 [2025-04-13 23:35:20,179 INFO L226 Difference]: Without dead ends: 13026 [2025-04-13 23:35:20,184 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:35:20,184 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 329 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1630 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:20,184 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 119 Invalid, 1655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1630 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:35:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13026 states. [2025-04-13 23:35:20,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13026 to 6543. [2025-04-13 23:35:20,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6543 states, 6542 states have (on average 3.654692754509324) internal successors, (23909), 6542 states have internal predecessors, (23909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:20,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6543 states to 6543 states and 23909 transitions. [2025-04-13 23:35:20,379 INFO L79 Accepts]: Start accepts. Automaton has 6543 states and 23909 transitions. Word has length 54 [2025-04-13 23:35:20,379 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:20,379 INFO L485 AbstractCegarLoop]: Abstraction has 6543 states and 23909 transitions. [2025-04-13 23:35:20,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 23:35:20,379 INFO L278 IsEmpty]: Start isEmpty. Operand 6543 states and 23909 transitions. [2025-04-13 23:35:20,389 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:20,390 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:20,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:35:20,390 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable418 [2025-04-13 23:35:20,390 INFO L403 AbstractCegarLoop]: === Iteration 420 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:35:20,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:20,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1343627557, now seen corresponding path program 420 times [2025-04-13 23:35:20,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:20,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211052087] [2025-04-13 23:35:20,391 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:35:20,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:20,393 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:20,405 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:20,405 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:35:20,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:20,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 23:35:20,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:20,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211052087] [2025-04-13 23:35:20,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211052087] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:20,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:20,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:20,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396872738] [2025-04-13 23:35:20,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:20,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:20,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:20,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:20,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:20,995 INFO L87 Difference]: Start difference. First operand 6543 states and 23909 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:21,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:21,976 INFO L93 Difference]: Finished difference Result 11180 states and 39812 transitions. [2025-04-13 23:35:21,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:21,976 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:35:21,976 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:22,028 INFO L225 Difference]: With dead ends: 11180 [2025-04-13 23:35:22,028 INFO L226 Difference]: Without dead ends: 11109 [2025-04-13 23:35:22,032 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=406, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:35:22,032 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 255 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:22,033 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 108 Invalid, 1552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:35:22,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11109 states. [2025-04-13 23:35:22,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11109 to 6576. [2025-04-13 23:35:22,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6576 states, 6575 states have (on average 3.652015209125475) internal successors, (24012), 6575 states have internal predecessors, (24012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6576 states to 6576 states and 24012 transitions. [2025-04-13 23:35:22,197 INFO L79 Accepts]: Start accepts. Automaton has 6576 states and 24012 transitions. Word has length 54 [2025-04-13 23:35:22,197 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:22,197 INFO L485 AbstractCegarLoop]: Abstraction has 6576 states and 24012 transitions. [2025-04-13 23:35:22,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 23:35:22,197 INFO L278 IsEmpty]: Start isEmpty. Operand 6576 states and 24012 transitions. [2025-04-13 23:35:22,207 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:22,207 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:22,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:35:22,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable419 [2025-04-13 23:35:22,207 INFO L403 AbstractCegarLoop]: === Iteration 421 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:35:22,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:22,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1249977187, now seen corresponding path program 421 times [2025-04-13 23:35:22,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:22,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961511537] [2025-04-13 23:35:22,207 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:35:22,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:22,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:22,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:22,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:35:22,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:22,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:22,832 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961511537] [2025-04-13 23:35:22,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961511537] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:22,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:22,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:22,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564695735] [2025-04-13 23:35:22,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:22,833 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:22,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:22,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:22,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:22,833 INFO L87 Difference]: Start difference. First operand 6576 states and 24012 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:23,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:23,807 INFO L93 Difference]: Finished difference Result 13202 states and 46743 transitions. [2025-04-13 23:35:23,808 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:23,808 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:35:23,808 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:23,860 INFO L225 Difference]: With dead ends: 13202 [2025-04-13 23:35:23,861 INFO L226 Difference]: Without dead ends: 13131 [2025-04-13 23:35:23,865 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:35:23,865 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 278 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 1804 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:23,865 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 137 Invalid, 1826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1804 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:35:23,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13131 states. [2025-04-13 23:35:23,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13131 to 6584. [2025-04-13 23:35:23,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6584 states, 6583 states have (on average 3.650615221023849) internal successors, (24032), 6583 states have internal predecessors, (24032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6584 states to 6584 states and 24032 transitions. [2025-04-13 23:35:24,030 INFO L79 Accepts]: Start accepts. Automaton has 6584 states and 24032 transitions. Word has length 54 [2025-04-13 23:35:24,030 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:24,030 INFO L485 AbstractCegarLoop]: Abstraction has 6584 states and 24032 transitions. [2025-04-13 23:35:24,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 23:35:24,030 INFO L278 IsEmpty]: Start isEmpty. Operand 6584 states and 24032 transitions. [2025-04-13 23:35:24,041 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:24,042 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:24,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:35:24,042 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable420 [2025-04-13 23:35:24,042 INFO L403 AbstractCegarLoop]: === Iteration 422 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:35:24,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:24,042 INFO L85 PathProgramCache]: Analyzing trace with hash 403492231, now seen corresponding path program 422 times [2025-04-13 23:35:24,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:24,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904861457] [2025-04-13 23:35:24,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:35:24,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:24,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:24,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:24,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:35:24,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:24,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:24,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904861457] [2025-04-13 23:35:24,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904861457] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:24,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:24,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:24,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199015743] [2025-04-13 23:35:24,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:24,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:24,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:24,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:24,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:24,677 INFO L87 Difference]: Start difference. First operand 6584 states and 24032 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:25,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:25,550 INFO L93 Difference]: Finished difference Result 11187 states and 39819 transitions. [2025-04-13 23:35:25,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:25,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 23:35:25,551 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:25,599 INFO L225 Difference]: With dead ends: 11187 [2025-04-13 23:35:25,599 INFO L226 Difference]: Without dead ends: 11106 [2025-04-13 23:35:25,602 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:35:25,603 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 284 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:25,603 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 101 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:35:25,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11106 states. [2025-04-13 23:35:25,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11106 to 6573. [2025-04-13 23:35:25,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6573 states, 6572 states have (on average 3.650943396226415) internal successors, (23994), 6572 states have internal predecessors, (23994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:25,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6573 states to 6573 states and 23994 transitions. [2025-04-13 23:35:25,761 INFO L79 Accepts]: Start accepts. Automaton has 6573 states and 23994 transitions. Word has length 54 [2025-04-13 23:35:25,762 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:25,762 INFO L485 AbstractCegarLoop]: Abstraction has 6573 states and 23994 transitions. [2025-04-13 23:35:25,762 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:25,762 INFO L278 IsEmpty]: Start isEmpty. Operand 6573 states and 23994 transitions. [2025-04-13 23:35:25,773 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:25,773 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:25,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:35:25,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable421 [2025-04-13 23:35:25,773 INFO L403 AbstractCegarLoop]: === Iteration 423 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:35:25,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:25,774 INFO L85 PathProgramCache]: Analyzing trace with hash 472103797, now seen corresponding path program 423 times [2025-04-13 23:35:25,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:25,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286459507] [2025-04-13 23:35:25,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:35:25,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:25,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:25,786 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:25,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:35:25,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:26,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 23:35:26,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:26,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286459507] [2025-04-13 23:35:26,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286459507] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:26,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:26,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:26,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131211196] [2025-04-13 23:35:26,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:26,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:26,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:26,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:26,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:26,376 INFO L87 Difference]: Start difference. First operand 6573 states and 23994 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:27,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:27,388 INFO L93 Difference]: Finished difference Result 13120 states and 46517 transitions. [2025-04-13 23:35:27,388 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:27,388 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:35:27,388 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:27,444 INFO L225 Difference]: With dead ends: 13120 [2025-04-13 23:35:27,444 INFO L226 Difference]: Without dead ends: 13024 [2025-04-13 23:35:27,448 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:35:27,448 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 262 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 1807 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:27,448 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 137 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1807 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:35:27,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13024 states. [2025-04-13 23:35:27,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13024 to 6541. [2025-04-13 23:35:27,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6541 states, 6540 states have (on average 3.6559633027522938) internal successors, (23910), 6540 states have internal predecessors, (23910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:27,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6541 states to 6541 states and 23910 transitions. [2025-04-13 23:35:27,616 INFO L79 Accepts]: Start accepts. Automaton has 6541 states and 23910 transitions. Word has length 54 [2025-04-13 23:35:27,617 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:27,617 INFO L485 AbstractCegarLoop]: Abstraction has 6541 states and 23910 transitions. [2025-04-13 23:35:27,617 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:27,617 INFO L278 IsEmpty]: Start isEmpty. Operand 6541 states and 23910 transitions. [2025-04-13 23:35:27,627 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:27,627 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:27,627 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:35:27,627 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable422 [2025-04-13 23:35:27,627 INFO L403 AbstractCegarLoop]: === Iteration 424 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:35:27,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:27,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2017058965, now seen corresponding path program 424 times [2025-04-13 23:35:27,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:27,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347637319] [2025-04-13 23:35:27,628 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:35:27,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:27,630 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:35:27,642 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 23:35:27,642 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:35:27,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:28,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:28,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:28,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347637319] [2025-04-13 23:35:28,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347637319] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:28,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:28,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:28,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741901994] [2025-04-13 23:35:28,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:28,251 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:28,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:28,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:28,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:28,252 INFO L87 Difference]: Start difference. First operand 6541 states and 23910 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:29,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:29,176 INFO L93 Difference]: Finished difference Result 11074 states and 39519 transitions. [2025-04-13 23:35:29,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:29,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 23:35:29,176 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:29,226 INFO L225 Difference]: With dead ends: 11074 [2025-04-13 23:35:29,226 INFO L226 Difference]: Without dead ends: 10696 [2025-04-13 23:35:29,230 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:35:29,230 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 256 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:29,230 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 102 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1439 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:35:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10696 states. [2025-04-13 23:35:29,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10696 to 6277. [2025-04-13 23:35:29,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6277 states, 6276 states have (on average 3.67797960484385) internal successors, (23083), 6276 states have internal predecessors, (23083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:29,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6277 states to 6277 states and 23083 transitions. [2025-04-13 23:35:29,378 INFO L79 Accepts]: Start accepts. Automaton has 6277 states and 23083 transitions. Word has length 54 [2025-04-13 23:35:29,379 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:29,379 INFO L485 AbstractCegarLoop]: Abstraction has 6277 states and 23083 transitions. [2025-04-13 23:35:29,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 23:35:29,379 INFO L278 IsEmpty]: Start isEmpty. Operand 6277 states and 23083 transitions. [2025-04-13 23:35:29,388 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:29,388 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:29,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 23:35:29,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable423 [2025-04-13 23:35:29,389 INFO L403 AbstractCegarLoop]: === Iteration 425 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:35:29,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:29,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1940962523, now seen corresponding path program 425 times [2025-04-13 23:35:29,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:29,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023345261] [2025-04-13 23:35:29,389 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:35:29,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:29,414 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:29,424 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:29,425 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:35:29,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:30,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:30,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:30,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023345261] [2025-04-13 23:35:30,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023345261] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:30,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:30,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:30,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652258683] [2025-04-13 23:35:30,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:30,013 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:30,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:30,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:30,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:30,014 INFO L87 Difference]: Start difference. First operand 6277 states and 23083 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:30,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:30,959 INFO L93 Difference]: Finished difference Result 13162 states and 46605 transitions. [2025-04-13 23:35:30,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:30,959 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:35:30,959 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:31,014 INFO L225 Difference]: With dead ends: 13162 [2025-04-13 23:35:31,015 INFO L226 Difference]: Without dead ends: 13091 [2025-04-13 23:35:31,019 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 23:35:31,019 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 359 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:31,019 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 118 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1619 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:35:31,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13091 states. [2025-04-13 23:35:31,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13091 to 6317. [2025-04-13 23:35:31,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6317 states, 6316 states have (on average 3.676060797973401) internal successors, (23218), 6316 states have internal predecessors, (23218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:31,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6317 states to 6317 states and 23218 transitions. [2025-04-13 23:35:31,186 INFO L79 Accepts]: Start accepts. Automaton has 6317 states and 23218 transitions. Word has length 54 [2025-04-13 23:35:31,186 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:31,186 INFO L485 AbstractCegarLoop]: Abstraction has 6317 states and 23218 transitions. [2025-04-13 23:35:31,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 23:35:31,186 INFO L278 IsEmpty]: Start isEmpty. Operand 6317 states and 23218 transitions. [2025-04-13 23:35:31,196 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:31,196 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:31,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:35:31,196 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable424 [2025-04-13 23:35:31,196 INFO L403 AbstractCegarLoop]: === Iteration 426 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:35:31,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:31,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1080180707, now seen corresponding path program 426 times [2025-04-13 23:35:31,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:31,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493995879] [2025-04-13 23:35:31,197 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:35:31,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:31,199 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:31,209 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:31,210 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:35:31,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:31,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:31,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:31,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493995879] [2025-04-13 23:35:31,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493995879] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:31,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:31,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:31,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146794836] [2025-04-13 23:35:31,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:31,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:31,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:31,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:31,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:31,805 INFO L87 Difference]: Start difference. First operand 6317 states and 23218 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:32,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:32,906 INFO L93 Difference]: Finished difference Result 11494 states and 40867 transitions. [2025-04-13 23:35:32,906 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:32,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 23:35:32,906 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:32,957 INFO L225 Difference]: With dead ends: 11494 [2025-04-13 23:35:32,957 INFO L226 Difference]: Without dead ends: 11426 [2025-04-13 23:35:32,961 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:35:32,961 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 317 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1563 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:32,961 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 116 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1563 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:35:32,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11426 states. [2025-04-13 23:35:33,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11426 to 6553. [2025-04-13 23:35:33,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6553 states, 6552 states have (on average 3.6707875457875456) internal successors, (24051), 6552 states have internal predecessors, (24051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:33,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6553 states to 6553 states and 24051 transitions. [2025-04-13 23:35:33,122 INFO L79 Accepts]: Start accepts. Automaton has 6553 states and 24051 transitions. Word has length 54 [2025-04-13 23:35:33,122 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:33,122 INFO L485 AbstractCegarLoop]: Abstraction has 6553 states and 24051 transitions. [2025-04-13 23:35:33,122 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:33,123 INFO L278 IsEmpty]: Start isEmpty. Operand 6553 states and 24051 transitions. [2025-04-13 23:35:33,132 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:33,133 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:33,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:35:33,133 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable425 [2025-04-13 23:35:33,133 INFO L403 AbstractCegarLoop]: === Iteration 427 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:35:33,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:33,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1554000197, now seen corresponding path program 427 times [2025-04-13 23:35:33,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:33,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692374120] [2025-04-13 23:35:33,133 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:35:33,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:33,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:33,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:33,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:35:33,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:33,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:33,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:33,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692374120] [2025-04-13 23:35:33,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692374120] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:33,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:33,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:33,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108045442] [2025-04-13 23:35:33,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:33,721 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:33,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:33,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:33,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:33,722 INFO L87 Difference]: Start difference. First operand 6553 states and 24051 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:34,617 INFO L93 Difference]: Finished difference Result 13327 states and 47248 transitions. [2025-04-13 23:35:34,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:34,617 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:35:34,617 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:34,668 INFO L225 Difference]: With dead ends: 13327 [2025-04-13 23:35:34,668 INFO L226 Difference]: Without dead ends: 13249 [2025-04-13 23:35:34,672 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:35:34,672 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 379 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:34,672 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 111 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:35:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13249 states. [2025-04-13 23:35:34,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13249 to 6543. [2025-04-13 23:35:34,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6543 states, 6542 states have (on average 3.671048608988077) internal successors, (24016), 6542 states have internal predecessors, (24016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:34,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6543 states to 6543 states and 24016 transitions. [2025-04-13 23:35:34,844 INFO L79 Accepts]: Start accepts. Automaton has 6543 states and 24016 transitions. Word has length 54 [2025-04-13 23:35:34,844 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:34,844 INFO L485 AbstractCegarLoop]: Abstraction has 6543 states and 24016 transitions. [2025-04-13 23:35:34,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 23:35:34,844 INFO L278 IsEmpty]: Start isEmpty. Operand 6543 states and 24016 transitions. [2025-04-13 23:35:34,854 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:34,854 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:34,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 23:35:34,854 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable426 [2025-04-13 23:35:34,854 INFO L403 AbstractCegarLoop]: === Iteration 428 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:35:34,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:34,854 INFO L85 PathProgramCache]: Analyzing trace with hash 280176131, now seen corresponding path program 428 times [2025-04-13 23:35:34,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:34,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215918227] [2025-04-13 23:35:34,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:35:34,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:34,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:34,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:34,868 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:35:34,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:35,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:35,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215918227] [2025-04-13 23:35:35,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215918227] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:35,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:35,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:35,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368958507] [2025-04-13 23:35:35,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:35,414 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:35,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:35,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:35,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:35,414 INFO L87 Difference]: Start difference. First operand 6543 states and 24016 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:36,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:36,496 INFO L93 Difference]: Finished difference Result 11416 states and 40649 transitions. [2025-04-13 23:35:36,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:36,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 23:35:36,496 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:36,545 INFO L225 Difference]: With dead ends: 11416 [2025-04-13 23:35:36,545 INFO L226 Difference]: Without dead ends: 11335 [2025-04-13 23:35:36,547 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:35:36,547 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 275 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:36,547 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 122 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:35:36,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11335 states. [2025-04-13 23:35:36,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11335 to 6533. [2025-04-13 23:35:36,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6533 states, 6532 states have (on average 3.671310471524801) internal successors, (23981), 6532 states have internal predecessors, (23981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:36,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6533 states to 6533 states and 23981 transitions. [2025-04-13 23:35:36,694 INFO L79 Accepts]: Start accepts. Automaton has 6533 states and 23981 transitions. Word has length 54 [2025-04-13 23:35:36,694 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:36,694 INFO L485 AbstractCegarLoop]: Abstraction has 6533 states and 23981 transitions. [2025-04-13 23:35:36,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 23:35:36,694 INFO L278 IsEmpty]: Start isEmpty. Operand 6533 states and 23981 transitions. [2025-04-13 23:35:36,704 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:36,704 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:36,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 23:35:36,704 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable427 [2025-04-13 23:35:36,705 INFO L403 AbstractCegarLoop]: === Iteration 429 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:35:36,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:36,705 INFO L85 PathProgramCache]: Analyzing trace with hash -639640355, now seen corresponding path program 429 times [2025-04-13 23:35:36,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:36,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012839483] [2025-04-13 23:35:36,705 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:35:36,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:36,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:36,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:36,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:35:36,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:37,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:37,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012839483] [2025-04-13 23:35:37,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012839483] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:37,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:37,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:37,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569575698] [2025-04-13 23:35:37,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:37,328 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:37,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:37,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:37,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:37,328 INFO L87 Difference]: Start difference. First operand 6533 states and 23981 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:38,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:38,254 INFO L93 Difference]: Finished difference Result 13356 states and 47319 transitions. [2025-04-13 23:35:38,254 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:38,254 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:35:38,254 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:38,311 INFO L225 Difference]: With dead ends: 13356 [2025-04-13 23:35:38,311 INFO L226 Difference]: Without dead ends: 13219 [2025-04-13 23:35:38,315 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 23:35:38,316 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 350 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1625 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:38,316 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 119 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1625 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:35:38,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13219 states. [2025-04-13 23:35:38,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13219 to 6513. [2025-04-13 23:35:38,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6513 states, 6512 states have (on average 3.6718366093366095) internal successors, (23911), 6512 states have internal predecessors, (23911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6513 states to 6513 states and 23911 transitions. [2025-04-13 23:35:38,479 INFO L79 Accepts]: Start accepts. Automaton has 6513 states and 23911 transitions. Word has length 54 [2025-04-13 23:35:38,479 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:38,480 INFO L485 AbstractCegarLoop]: Abstraction has 6513 states and 23911 transitions. [2025-04-13 23:35:38,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 23:35:38,480 INFO L278 IsEmpty]: Start isEmpty. Operand 6513 states and 23911 transitions. [2025-04-13 23:35:38,513 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:38,513 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:38,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:35:38,513 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable428 [2025-04-13 23:35:38,514 INFO L403 AbstractCegarLoop]: === Iteration 430 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:35:38,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:38,514 INFO L85 PathProgramCache]: Analyzing trace with hash 855221285, now seen corresponding path program 430 times [2025-04-13 23:35:38,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:38,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445508484] [2025-04-13 23:35:38,514 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:35:38,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:38,517 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:35:38,529 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 23:35:38,529 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:35:38,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:39,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:39,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445508484] [2025-04-13 23:35:39,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445508484] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:39,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:39,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 23:35:39,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996597255] [2025-04-13 23:35:39,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:39,169 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:35:39,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:39,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:35:39,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:35:39,169 INFO L87 Difference]: Start difference. First operand 6513 states and 23911 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:40,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:40,428 INFO L93 Difference]: Finished difference Result 12064 states and 42949 transitions. [2025-04-13 23:35:40,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:35:40,428 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:35:40,428 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:40,479 INFO L225 Difference]: With dead ends: 12064 [2025-04-13 23:35:40,479 INFO L226 Difference]: Without dead ends: 11936 [2025-04-13 23:35:40,483 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=220, Invalid=482, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:35:40,483 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 292 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 2010 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 2039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:40,483 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 153 Invalid, 2039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2010 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 23:35:40,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11936 states. [2025-04-13 23:35:40,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11936 to 6693. [2025-04-13 23:35:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6693 states, 6692 states have (on average 3.6634787806335924) internal successors, (24516), 6692 states have internal predecessors, (24516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:40,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6693 states to 6693 states and 24516 transitions. [2025-04-13 23:35:40,647 INFO L79 Accepts]: Start accepts. Automaton has 6693 states and 24516 transitions. Word has length 54 [2025-04-13 23:35:40,648 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:40,648 INFO L485 AbstractCegarLoop]: Abstraction has 6693 states and 24516 transitions. [2025-04-13 23:35:40,648 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:40,648 INFO L278 IsEmpty]: Start isEmpty. Operand 6693 states and 24516 transitions. [2025-04-13 23:35:40,658 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:40,658 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:40,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:35:40,658 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable429 [2025-04-13 23:35:40,658 INFO L403 AbstractCegarLoop]: === Iteration 431 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:35:40,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:40,659 INFO L85 PathProgramCache]: Analyzing trace with hash 598472731, now seen corresponding path program 431 times [2025-04-13 23:35:40,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:40,659 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48449792] [2025-04-13 23:35:40,659 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:35:40,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:40,661 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:40,671 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:40,671 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:35:40,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:41,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:41,292 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48449792] [2025-04-13 23:35:41,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48449792] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:41,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:41,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:41,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903421287] [2025-04-13 23:35:41,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:41,292 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:41,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:41,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:41,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:41,292 INFO L87 Difference]: Start difference. First operand 6693 states and 24516 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:42,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:42,263 INFO L93 Difference]: Finished difference Result 13520 states and 47857 transitions. [2025-04-13 23:35:42,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:42,263 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:35:42,263 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:42,318 INFO L225 Difference]: With dead ends: 13520 [2025-04-13 23:35:42,318 INFO L226 Difference]: Without dead ends: 13449 [2025-04-13 23:35:42,322 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 23:35:42,322 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 329 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:42,322 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 125 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1713 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:35:42,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13449 states. [2025-04-13 23:35:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13449 to 6708. [2025-04-13 23:35:42,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6708 states, 6707 states have (on average 3.66199493066945) internal successors, (24561), 6707 states have internal predecessors, (24561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6708 states to 6708 states and 24561 transitions. [2025-04-13 23:35:42,484 INFO L79 Accepts]: Start accepts. Automaton has 6708 states and 24561 transitions. Word has length 54 [2025-04-13 23:35:42,484 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:42,484 INFO L485 AbstractCegarLoop]: Abstraction has 6708 states and 24561 transitions. [2025-04-13 23:35:42,484 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:42,484 INFO L278 IsEmpty]: Start isEmpty. Operand 6708 states and 24561 transitions. [2025-04-13 23:35:42,494 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:42,494 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:42,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 23:35:42,494 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable430 [2025-04-13 23:35:42,494 INFO L403 AbstractCegarLoop]: === Iteration 432 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:35:42,495 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:42,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1074929155, now seen corresponding path program 432 times [2025-04-13 23:35:42,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:42,495 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690801880] [2025-04-13 23:35:42,495 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:35:42,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:42,497 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:42,507 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:42,507 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:35:42,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:43,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 23:35:43,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:43,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690801880] [2025-04-13 23:35:43,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690801880] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:43,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:43,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:43,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335573620] [2025-04-13 23:35:43,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:43,098 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:43,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:43,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:43,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:43,098 INFO L87 Difference]: Start difference. First operand 6708 states and 24561 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:44,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:44,185 INFO L93 Difference]: Finished difference Result 11617 states and 41313 transitions. [2025-04-13 23:35:44,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:44,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 23:35:44,186 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:44,235 INFO L225 Difference]: With dead ends: 11617 [2025-04-13 23:35:44,235 INFO L226 Difference]: Without dead ends: 11549 [2025-04-13 23:35:44,239 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:35:44,239 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 317 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:44,239 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 110 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:35:44,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11549 states. [2025-04-13 23:35:44,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11549 to 6738. [2025-04-13 23:35:44,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6738 states, 6737 states have (on average 3.65978922369007) internal successors, (24656), 6737 states have internal predecessors, (24656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6738 states to 6738 states and 24656 transitions. [2025-04-13 23:35:44,400 INFO L79 Accepts]: Start accepts. Automaton has 6738 states and 24656 transitions. Word has length 54 [2025-04-13 23:35:44,400 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:44,400 INFO L485 AbstractCegarLoop]: Abstraction has 6738 states and 24656 transitions. [2025-04-13 23:35:44,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 23:35:44,400 INFO L278 IsEmpty]: Start isEmpty. Operand 6738 states and 24656 transitions. [2025-04-13 23:35:44,410 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:44,410 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:44,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:35:44,410 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable431 [2025-04-13 23:35:44,411 INFO L403 AbstractCegarLoop]: === Iteration 433 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:35:44,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:44,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1398477307, now seen corresponding path program 433 times [2025-04-13 23:35:44,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:44,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915408348] [2025-04-13 23:35:44,411 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:35:44,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:44,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:44,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:44,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:35:44,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:44,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:44,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:44,984 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915408348] [2025-04-13 23:35:44,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915408348] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:44,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:44,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:44,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389291311] [2025-04-13 23:35:44,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:44,985 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:44,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:44,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:44,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:44,985 INFO L87 Difference]: Start difference. First operand 6738 states and 24656 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:45,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:45,953 INFO L93 Difference]: Finished difference Result 13547 states and 47935 transitions. [2025-04-13 23:35:45,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:45,953 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:35:45,953 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:46,010 INFO L225 Difference]: With dead ends: 13547 [2025-04-13 23:35:46,010 INFO L226 Difference]: Without dead ends: 13469 [2025-04-13 23:35:46,015 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 23:35:46,016 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 395 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:46,016 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 107 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:35:46,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13469 states. [2025-04-13 23:35:46,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13469 to 6728. [2025-04-13 23:35:46,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6728 states, 6727 states have (on average 3.660770031217482) internal successors, (24626), 6727 states have internal predecessors, (24626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:46,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6728 states to 6728 states and 24626 transitions. [2025-04-13 23:35:46,191 INFO L79 Accepts]: Start accepts. Automaton has 6728 states and 24626 transitions. Word has length 54 [2025-04-13 23:35:46,191 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:46,191 INFO L485 AbstractCegarLoop]: Abstraction has 6728 states and 24626 transitions. [2025-04-13 23:35:46,191 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:46,191 INFO L278 IsEmpty]: Start isEmpty. Operand 6728 states and 24626 transitions. [2025-04-13 23:35:46,201 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:46,201 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:46,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:35:46,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable432 [2025-04-13 23:35:46,202 INFO L403 AbstractCegarLoop]: === Iteration 434 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:35:46,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:46,202 INFO L85 PathProgramCache]: Analyzing trace with hash 274924579, now seen corresponding path program 434 times [2025-04-13 23:35:46,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:46,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029012972] [2025-04-13 23:35:46,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:35:46,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:46,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:46,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:46,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:35:46,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:46,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 23:35:46,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:46,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029012972] [2025-04-13 23:35:46,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029012972] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:46,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:46,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:46,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502225027] [2025-04-13 23:35:46,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:46,781 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:46,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:46,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:46,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:46,782 INFO L87 Difference]: Start difference. First operand 6728 states and 24626 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:47,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:47,886 INFO L93 Difference]: Finished difference Result 11610 states and 41280 transitions. [2025-04-13 23:35:47,886 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:47,886 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:35:47,886 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:47,942 INFO L225 Difference]: With dead ends: 11610 [2025-04-13 23:35:47,942 INFO L226 Difference]: Without dead ends: 11529 [2025-04-13 23:35:47,946 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:35:47,946 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 291 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:47,946 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 118 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:35:47,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11529 states. [2025-04-13 23:35:48,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11529 to 6718. [2025-04-13 23:35:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6718 states, 6717 states have (on average 3.661009379187137) internal successors, (24591), 6717 states have internal predecessors, (24591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6718 states to 6718 states and 24591 transitions. [2025-04-13 23:35:48,130 INFO L79 Accepts]: Start accepts. Automaton has 6718 states and 24591 transitions. Word has length 54 [2025-04-13 23:35:48,131 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:48,131 INFO L485 AbstractCegarLoop]: Abstraction has 6718 states and 24591 transitions. [2025-04-13 23:35:48,131 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:48,131 INFO L278 IsEmpty]: Start isEmpty. Operand 6718 states and 24591 transitions. [2025-04-13 23:35:48,141 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:48,141 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:48,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:35:48,141 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable433 [2025-04-13 23:35:48,141 INFO L403 AbstractCegarLoop]: === Iteration 435 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:35:48,142 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:48,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1811508231, now seen corresponding path program 435 times [2025-04-13 23:35:48,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:48,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632333122] [2025-04-13 23:35:48,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:35:48,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:48,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:48,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:48,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:35:48,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:48,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:48,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:48,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632333122] [2025-04-13 23:35:48,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632333122] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:48,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:48,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:48,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970716614] [2025-04-13 23:35:48,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:48,797 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:48,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:48,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:48,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:48,797 INFO L87 Difference]: Start difference. First operand 6718 states and 24591 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:49,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:49,683 INFO L93 Difference]: Finished difference Result 13540 states and 47913 transitions. [2025-04-13 23:35:49,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:35:49,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 23:35:49,683 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:49,734 INFO L225 Difference]: With dead ends: 13540 [2025-04-13 23:35:49,734 INFO L226 Difference]: Without dead ends: 13469 [2025-04-13 23:35:49,738 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:35:49,738 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 386 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:49,738 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 107 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:35:49,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13469 states. [2025-04-13 23:35:49,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13469 to 6729. [2025-04-13 23:35:49,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6729 states, 6728 states have (on average 3.659036860879905) internal successors, (24618), 6728 states have internal predecessors, (24618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6729 states to 6729 states and 24618 transitions. [2025-04-13 23:35:49,908 INFO L79 Accepts]: Start accepts. Automaton has 6729 states and 24618 transitions. Word has length 54 [2025-04-13 23:35:49,908 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:49,908 INFO L485 AbstractCegarLoop]: Abstraction has 6729 states and 24618 transitions. [2025-04-13 23:35:49,908 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:49,908 INFO L278 IsEmpty]: Start isEmpty. Operand 6729 states and 24618 transitions. [2025-04-13 23:35:49,919 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:49,919 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:49,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 23:35:49,919 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable434 [2025-04-13 23:35:49,919 INFO L403 AbstractCegarLoop]: === Iteration 436 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:35:49,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:49,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1989288997, now seen corresponding path program 436 times [2025-04-13 23:35:49,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:49,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369007709] [2025-04-13 23:35:49,919 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:35:49,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:49,922 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-04-13 23:35:49,934 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 23:35:49,934 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:35:49,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:50,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 23:35:50,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:50,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369007709] [2025-04-13 23:35:50,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369007709] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:50,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:50,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 23:35:50,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818076967] [2025-04-13 23:35:50,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:50,597 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:35:50,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:50,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:35:50,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:35:50,598 INFO L87 Difference]: Start difference. First operand 6729 states and 24618 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:51,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:35:51,920 INFO L93 Difference]: Finished difference Result 12129 states and 43112 transitions. [2025-04-13 23:35:51,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:35:51,920 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-04-13 23:35:51,920 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:35:51,972 INFO L225 Difference]: With dead ends: 12129 [2025-04-13 23:35:51,972 INFO L226 Difference]: Without dead ends: 11952 [2025-04-13 23:35:51,976 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=220, Invalid=482, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:35:51,977 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 276 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 2099 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:51,977 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 162 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2099 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 23:35:51,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11952 states. [2025-04-13 23:35:52,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11952 to 6689. [2025-04-13 23:35:52,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6689 states, 6688 states have (on average 3.659988038277512) internal successors, (24478), 6688 states have internal predecessors, (24478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:52,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6689 states to 6689 states and 24478 transitions. [2025-04-13 23:35:52,145 INFO L79 Accepts]: Start accepts. Automaton has 6689 states and 24478 transitions. Word has length 54 [2025-04-13 23:35:52,145 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:35:52,145 INFO L485 AbstractCegarLoop]: Abstraction has 6689 states and 24478 transitions. [2025-04-13 23:35:52,145 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:35:52,145 INFO L278 IsEmpty]: Start isEmpty. Operand 6689 states and 24478 transitions. [2025-04-13 23:35:52,156 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:35:52,156 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:35:52,156 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:35:52,156 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable435 [2025-04-13 23:35:52,156 INFO L403 AbstractCegarLoop]: === Iteration 437 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:35:52,156 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:35:52,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1543323739, now seen corresponding path program 437 times [2025-04-13 23:35:52,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:35:52,156 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717718406] [2025-04-13 23:35:52,156 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:35:52,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:35:52,159 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 54 statements into 1 equivalence classes. [2025-04-13 23:35:52,168 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:35:52,168 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:35:52,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:35:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:35:52,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:35:52,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717718406] [2025-04-13 23:35:52,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717718406] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:35:52,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:35:52,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:35:52,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499016236] [2025-04-13 23:35:52,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:35:52,820 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:35:52,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:35:52,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:35:52,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:35:52,821 INFO L87 Difference]: Start difference. First operand 6689 states and 24478 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 14 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2025-04-13 23:35:53,296 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 23:35:53,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:35:53,297 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-04-13 23:35:53,297 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 90 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:35:53,297 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 118 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:35:53,298 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 23:35:53,298 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable436 [2025-04-13 23:35:53,298 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (6689states) and FLOYD_HOARE automaton (currently 8 states, 14 states before enhancement),while ReachableStatesComputation was computing reachable states (4099 states constructed, input type IntersectNwa). [2025-04-13 23:35:53,299 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 23:35:53,299 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 23:35:53,299 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 23:35:53,299 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 23:35:53,301 INFO L422 BasicCegarLoop]: Path program histogram: [437] [2025-04-13 23:35:53,303 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:35:53,303 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:35:53,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:35:53 BasicIcfg [2025-04-13 23:35:53,304 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:35:53,304 INFO L158 Benchmark]: Toolchain (without parser) took 805598.55ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 100.7MB in the beginning and 1.0GB in the end (delta: -912.1MB). Peak memory consumption was 617.8MB. Max. memory is 8.0GB. [2025-04-13 23:35:53,304 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:35:53,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.82ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 85.7MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 23:35:53,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.95ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 83.6MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:35:53,304 INFO L158 Benchmark]: Boogie Preprocessor took 25.13ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 82.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:35:53,304 INFO L158 Benchmark]: IcfgBuilder took 481.00ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 46.5MB in the end (delta: 35.8MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-13 23:35:53,304 INFO L158 Benchmark]: TraceAbstraction took 804835.95ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 45.9MB in the beginning and 1.0GB in the end (delta: -966.8MB). Peak memory consumption was 563.3MB. Max. memory is 8.0GB. [2025-04-13 23:35:53,305 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.18ms. Allocated memory is still 167.8MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 211.82ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 85.7MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.95ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 83.6MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.13ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 82.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 481.00ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 46.5MB in the end (delta: 35.8MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 804835.95ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 45.9MB in the beginning and 1.0GB in the end (delta: -966.8MB). Peak memory consumption was 563.3MB. 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 constructing difference of abstraction (6689states) and FLOYD_HOARE automaton (currently 8 states, 14 states before enhancement),while ReachableStatesComputation was computing reachable states (4099 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (6689states) and FLOYD_HOARE automaton (currently 8 states, 14 states before enhancement),while ReachableStatesComputation was computing reachable states (4099 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (6689states) and FLOYD_HOARE automaton (currently 8 states, 14 states before enhancement),while ReachableStatesComputation was computing reachable states (4099 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (6689states) and FLOYD_HOARE automaton (currently 8 states, 14 states before enhancement),while ReachableStatesComputation was computing reachable states (4099 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (6689states) and FLOYD_HOARE automaton (currently 8 states, 14 states before enhancement),while ReachableStatesComputation was computing reachable states (4099 states constructed, input type IntersectNwa). - 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: 804.7s, OverallIterations: 437, TraceHistogramMax: 1, PathProgramHistogramMax: 437, EmptinessCheckTime: 5.2s, AutomataDifference: 443.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130821 SdHoareTripleChecker+Valid, 283.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130821 mSDsluCounter, 51931 SdHoareTripleChecker+Invalid, 242.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45854 mSDsCounter, 9693 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 685917 IncrementalHoareTripleChecker+Invalid, 695610 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9693 mSolverCounterUnsat, 6077 mSDtfsCounter, 685917 mSolverCounterSat, 2.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10340 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 9879 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20824 ImplicationChecksByTransitivity, 151.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15591occurred in iteration=0, InterpolantAutomatonStates: 6630, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 65.4s AutomataMinimizationTime, 436 MinimizatonAttempts, 2414897 StatesRemovedByMinimization, 432 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 270.5s InterpolantComputationTime, 23598 NumberOfCodeBlocks, 23598 NumberOfCodeBlocksAsserted, 510 NumberOfCheckSat, 23161 ConstructedInterpolants, 0 QuantifiedInterpolants, 390703 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 437 InterpolantComputations, 437 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