/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/chl-chromosome-opt-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:12:22,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:12:22,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 22:12:22,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:12:22,399 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:12:22,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:12:22,421 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:12:22,421 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:12:22,421 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:12:22,421 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:12:22,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:12:22,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:12:22,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:12:22,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:12:22,423 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:12:22,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:12:22,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:12:22,423 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:12:22,423 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:12:22,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:12:22,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:12:22,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:12:22,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:12:22,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:12:22,424 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:12:22,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:12:22,424 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:12:22,424 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:12:22,424 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:12:22,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:12:22,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:12:22,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:12:22,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:12:22,424 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:12:22,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:12:22,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:12:22,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:12:22,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:12:22,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:12:22,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:12:22,425 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:12:22,425 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:12:22,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:12:22,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:12:22,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:12:22,425 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:12:22,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:12:22,425 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 22:12:22,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:12:22,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:12:22,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:12:22,628 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:12:22,628 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:12:22,629 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-chromosome-opt-symm.wvr.c [2025-04-13 22:12:23,935 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71e10c5eb/efb397b4c3f44dab9411dcded70fcc94/FLAG5236aa00f [2025-04-13 22:12:24,120 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:12:24,120 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-opt-symm.wvr.c [2025-04-13 22:12:24,126 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71e10c5eb/efb397b4c3f44dab9411dcded70fcc94/FLAG5236aa00f [2025-04-13 22:12:24,985 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71e10c5eb/efb397b4c3f44dab9411dcded70fcc94 [2025-04-13 22:12:24,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:12:24,988 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:12:24,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:12:24,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:12:24,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:12:24,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:12:24" (1/1) ... [2025-04-13 22:12:24,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c3e45af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:24, skipping insertion in model container [2025-04-13 22:12:24,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:12:24" (1/1) ... [2025-04-13 22:12:25,007 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:12:25,174 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/chl-chromosome-opt-symm.wvr.c[2592,2605] [2025-04-13 22:12:25,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:12:25,194 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:12:25,217 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/chl-chromosome-opt-symm.wvr.c[2592,2605] [2025-04-13 22:12:25,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:12:25,232 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:12:25,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:25 WrapperNode [2025-04-13 22:12:25,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:12:25,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:12:25,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:12:25,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:12:25,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:25" (1/1) ... [2025-04-13 22:12:25,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:25" (1/1) ... [2025-04-13 22:12:25,261 INFO L138 Inliner]: procedures = 23, calls = 25, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 157 [2025-04-13 22:12:25,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:12:25,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:12:25,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:12:25,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:12:25,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:25" (1/1) ... [2025-04-13 22:12:25,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:25" (1/1) ... [2025-04-13 22:12:25,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:25" (1/1) ... [2025-04-13 22:12:25,293 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 22:12:25,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:25" (1/1) ... [2025-04-13 22:12:25,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:25" (1/1) ... [2025-04-13 22:12:25,301 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:25" (1/1) ... [2025-04-13 22:12:25,302 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:25" (1/1) ... [2025-04-13 22:12:25,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:25" (1/1) ... [2025-04-13 22:12:25,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:25" (1/1) ... [2025-04-13 22:12:25,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:12:25,308 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:12:25,308 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:12:25,308 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:12:25,309 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:25" (1/1) ... [2025-04-13 22:12:25,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:12:25,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:25,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 22:12:25,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 22:12:25,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:12:25,349 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:12:25,349 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:12:25,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:12:25,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:12:25,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:12:25,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 22:12:25,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 22:12:25,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 22:12:25,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 22:12:25,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:12:25,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:12:25,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 22:12:25,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 22:12:25,351 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 22:12:25,421 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:12:25,422 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:12:25,631 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:12:25,631 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:12:25,631 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:12:25,833 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:12:25,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:12:25 BoogieIcfgContainer [2025-04-13 22:12:25,833 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:12:25,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:12:25,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:12:25,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:12:25,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:12:24" (1/3) ... [2025-04-13 22:12:25,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44588ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:12:25, skipping insertion in model container [2025-04-13 22:12:25,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:25" (2/3) ... [2025-04-13 22:12:25,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44588ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:12:25, skipping insertion in model container [2025-04-13 22:12:25,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:12:25" (3/3) ... [2025-04-13 22:12:25,840 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-opt-symm.wvr.c [2025-04-13 22:12:25,850 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:12:25,851 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-opt-symm.wvr.c that has 3 procedures, 18 locations, 19 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 22:12:25,852 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:12:25,912 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 22:12:25,935 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 21 transitions, 56 flow [2025-04-13 22:12:25,945 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:25,965 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:12:25,972 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;@55367164, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:12:25,973 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 22:12:25,974 INFO L278 IsEmpty]: Start isEmpty. Operand has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:25,977 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 22:12:25,977 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:25,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:25,978 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:25,982 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:25,982 INFO L85 PathProgramCache]: Analyzing trace with hash -642387700, now seen corresponding path program 1 times [2025-04-13 22:12:25,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:25,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097816664] [2025-04-13 22:12:25,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:12:25,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:26,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 22:12:26,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 22:12:26,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:12:26,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:26,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:12:26,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:26,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097816664] [2025-04-13 22:12:26,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097816664] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:12:26,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:12:26,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:12:26,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830257133] [2025-04-13 22:12:26,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:26,277 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:12:26,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:26,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:12:26,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:12:26,295 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 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 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:26,358 INFO L93 Difference]: Finished difference Result 66 states and 143 transitions. [2025-04-13 22:12:26,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:12:26,360 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 22:12:26,360 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:26,364 INFO L225 Difference]: With dead ends: 66 [2025-04-13 22:12:26,364 INFO L226 Difference]: Without dead ends: 35 [2025-04-13 22:12:26,366 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:12:26,368 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:26,369 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:12:26,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-13 22:12:26,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-04-13 22:12:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 73 transitions. [2025-04-13 22:12:26,387 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 73 transitions. Word has length 14 [2025-04-13 22:12:26,387 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:26,387 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 73 transitions. [2025-04-13 22:12:26,387 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:26,387 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 73 transitions. [2025-04-13 22:12:26,388 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 22:12:26,388 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:26,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:26,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:12:26,388 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:26,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:26,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1041764769, now seen corresponding path program 1 times [2025-04-13 22:12:26,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:26,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320876235] [2025-04-13 22:12:26,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:12:26,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:26,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 22:12:26,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 22:12:26,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:12:26,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:26,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:12:26,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:26,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320876235] [2025-04-13 22:12:26,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320876235] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:26,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274174502] [2025-04-13 22:12:26,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:12:26,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:26,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:26,546 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:12:26,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 22:12:26,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 22:12:26,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 22:12:26,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:12:26,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:26,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 22:12:26,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:26,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:12:26,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:26,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:12:26,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274174502] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:12:26,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:12:26,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-04-13 22:12:26,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200284859] [2025-04-13 22:12:26,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:12:26,692 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:12:26,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:26,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:12:26,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:12:26,693 INFO L87 Difference]: Start difference. First operand 35 states and 73 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:26,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:26,756 INFO L93 Difference]: Finished difference Result 73 states and 154 transitions. [2025-04-13 22:12:26,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:12:26,756 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 22:12:26,756 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:26,757 INFO L225 Difference]: With dead ends: 73 [2025-04-13 22:12:26,757 INFO L226 Difference]: Without dead ends: 41 [2025-04-13 22:12:26,757 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:12:26,758 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:26,758 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:26,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-04-13 22:12:26,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-04-13 22:12:26,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.975) internal successors, (79), 40 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:26,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 79 transitions. [2025-04-13 22:12:26,763 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 79 transitions. Word has length 16 [2025-04-13 22:12:26,763 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:26,763 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 79 transitions. [2025-04-13 22:12:26,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:26,763 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 79 transitions. [2025-04-13 22:12:26,763 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:12:26,763 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:26,763 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:26,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 22:12:26,969 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:26,969 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:26,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:26,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1887718988, now seen corresponding path program 2 times [2025-04-13 22:12:26,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:26,970 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112122611] [2025-04-13 22:12:26,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:12:26,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:27,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:12:27,042 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 22 statements. [2025-04-13 22:12:27,042 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:12:27,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:27,750 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:12:27,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:27,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112122611] [2025-04-13 22:12:27,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112122611] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:12:27,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:12:27,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:12:27,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286992390] [2025-04-13 22:12:27,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:27,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:12:27,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:27,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:12:27,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:12:27,752 INFO L87 Difference]: Start difference. First operand 41 states and 79 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:28,076 INFO L93 Difference]: Finished difference Result 74 states and 151 transitions. [2025-04-13 22:12:28,076 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:12:28,076 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 22:12:28,076 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:28,077 INFO L225 Difference]: With dead ends: 74 [2025-04-13 22:12:28,077 INFO L226 Difference]: Without dead ends: 69 [2025-04-13 22:12:28,077 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:12:28,078 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:28,078 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:28,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-04-13 22:12:28,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 53. [2025-04-13 22:12:28,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 2.0) internal successors, (104), 52 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 104 transitions. [2025-04-13 22:12:28,085 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 104 transitions. Word has length 22 [2025-04-13 22:12:28,088 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:28,088 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 104 transitions. [2025-04-13 22:12:28,088 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:28,088 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 104 transitions. [2025-04-13 22:12:28,088 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:12:28,088 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:28,088 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:28,089 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:12:28,089 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:28,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:28,089 INFO L85 PathProgramCache]: Analyzing trace with hash -686782838, now seen corresponding path program 3 times [2025-04-13 22:12:28,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:28,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147335263] [2025-04-13 22:12:28,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:12:28,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:28,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:12:28,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 22 statements. [2025-04-13 22:12:28,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:12:28,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:28,703 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:12:28,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:28,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147335263] [2025-04-13 22:12:28,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147335263] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:12:28,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:12:28,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:12:28,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798532570] [2025-04-13 22:12:28,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:28,704 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:12:28,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:28,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:12:28,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:12:28,705 INFO L87 Difference]: Start difference. First operand 53 states and 104 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:28,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:28,923 INFO L93 Difference]: Finished difference Result 89 states and 172 transitions. [2025-04-13 22:12:28,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:12:28,923 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 22:12:28,923 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:28,924 INFO L225 Difference]: With dead ends: 89 [2025-04-13 22:12:28,924 INFO L226 Difference]: Without dead ends: 74 [2025-04-13 22:12:28,924 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:12:28,925 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:28,925 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:28,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-04-13 22:12:28,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2025-04-13 22:12:28,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 54 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:28,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 111 transitions. [2025-04-13 22:12:28,933 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 111 transitions. Word has length 22 [2025-04-13 22:12:28,936 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:28,936 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 111 transitions. [2025-04-13 22:12:28,936 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:28,937 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 111 transitions. [2025-04-13 22:12:28,937 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:12:28,937 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:28,937 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:28,937 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:12:28,937 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:28,938 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:28,938 INFO L85 PathProgramCache]: Analyzing trace with hash -684274628, now seen corresponding path program 4 times [2025-04-13 22:12:28,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:28,938 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171495603] [2025-04-13 22:12:28,938 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:12:28,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:28,951 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:12:28,961 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 11 of 22 statements. [2025-04-13 22:12:28,961 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:12:28,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:29,164 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:12:29,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:29,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171495603] [2025-04-13 22:12:29,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171495603] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:12:29,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:12:29,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:12:29,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886066793] [2025-04-13 22:12:29,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:29,165 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:12:29,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:29,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:12:29,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:12:29,165 INFO L87 Difference]: Start difference. First operand 55 states and 111 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:29,392 INFO L93 Difference]: Finished difference Result 82 states and 171 transitions. [2025-04-13 22:12:29,392 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:12:29,392 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 22:12:29,392 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:29,393 INFO L225 Difference]: With dead ends: 82 [2025-04-13 22:12:29,393 INFO L226 Difference]: Without dead ends: 77 [2025-04-13 22:12:29,393 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:12:29,393 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:29,394 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:29,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-13 22:12:29,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2025-04-13 22:12:29,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 2.0357142857142856) internal successors, (114), 56 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 114 transitions. [2025-04-13 22:12:29,404 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 114 transitions. Word has length 22 [2025-04-13 22:12:29,404 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:29,404 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 114 transitions. [2025-04-13 22:12:29,404 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:29,404 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 114 transitions. [2025-04-13 22:12:29,405 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:12:29,405 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:29,405 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:29,405 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:12:29,405 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:29,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:29,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1952484288, now seen corresponding path program 5 times [2025-04-13 22:12:29,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:29,406 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254433354] [2025-04-13 22:12:29,406 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:12:29,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:29,418 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:12:29,430 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:12:29,430 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:12:29,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:12:29,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:29,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254433354] [2025-04-13 22:12:29,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254433354] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:29,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802684805] [2025-04-13 22:12:29,507 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:12:29,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:29,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:29,509 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:12:29,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 22:12:29,566 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:12:29,609 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:12:29,609 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:12:29,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:29,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 22:12:29,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:12:29,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:12:29,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802684805] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:12:29,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:12:29,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-13 22:12:29,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043153656] [2025-04-13 22:12:29,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:12:29,698 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:12:29,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:29,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:12:29,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:12:29,699 INFO L87 Difference]: Start difference. First operand 57 states and 114 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:29,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:29,761 INFO L93 Difference]: Finished difference Result 110 states and 225 transitions. [2025-04-13 22:12:29,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:12:29,762 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 22:12:29,762 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:29,762 INFO L225 Difference]: With dead ends: 110 [2025-04-13 22:12:29,762 INFO L226 Difference]: Without dead ends: 59 [2025-04-13 22:12:29,763 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:12:29,763 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:29,763 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:12:29,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-13 22:12:29,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-04-13 22:12:29,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 2.0) internal successors, (116), 58 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 116 transitions. [2025-04-13 22:12:29,776 INFO L79 Accepts]: Start accepts. Automaton has 59 states and 116 transitions. Word has length 22 [2025-04-13 22:12:29,776 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:29,776 INFO L485 AbstractCegarLoop]: Abstraction has 59 states and 116 transitions. [2025-04-13 22:12:29,776 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:29,776 INFO L278 IsEmpty]: Start isEmpty. Operand 59 states and 116 transitions. [2025-04-13 22:12:29,776 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 22:12:29,776 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:29,777 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:29,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 22:12:29,977 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 22:12:29,977 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:29,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:29,978 INFO L85 PathProgramCache]: Analyzing trace with hash -975545899, now seen corresponding path program 6 times [2025-04-13 22:12:29,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:29,978 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619161057] [2025-04-13 22:12:29,978 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:12:29,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:29,994 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 4 equivalence classes. [2025-04-13 22:12:30,010 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 14 of 24 statements. [2025-04-13 22:12:30,010 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:12:30,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:30,414 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:30,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:30,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619161057] [2025-04-13 22:12:30,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619161057] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:12:30,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:12:30,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:12:30,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466833176] [2025-04-13 22:12:30,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:30,414 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:12:30,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:30,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:12:30,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:12:30,415 INFO L87 Difference]: Start difference. First operand 59 states and 116 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:30,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:30,612 INFO L93 Difference]: Finished difference Result 99 states and 194 transitions. [2025-04-13 22:12:30,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:12:30,612 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 22:12:30,612 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:30,613 INFO L225 Difference]: With dead ends: 99 [2025-04-13 22:12:30,613 INFO L226 Difference]: Without dead ends: 84 [2025-04-13 22:12:30,613 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:12:30,614 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:30,614 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 0 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:30,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-04-13 22:12:30,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 63. [2025-04-13 22:12:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 2.096774193548387) internal successors, (130), 62 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 130 transitions. [2025-04-13 22:12:30,626 INFO L79 Accepts]: Start accepts. Automaton has 63 states and 130 transitions. Word has length 24 [2025-04-13 22:12:30,626 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:30,626 INFO L485 AbstractCegarLoop]: Abstraction has 63 states and 130 transitions. [2025-04-13 22:12:30,626 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:30,626 INFO L278 IsEmpty]: Start isEmpty. Operand 63 states and 130 transitions. [2025-04-13 22:12:30,627 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 22:12:30,627 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:30,627 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:30,627 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:12:30,627 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:30,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:30,627 INFO L85 PathProgramCache]: Analyzing trace with hash -973037689, now seen corresponding path program 7 times [2025-04-13 22:12:30,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:30,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920710848] [2025-04-13 22:12:30,627 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:12:30,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:30,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 22:12:30,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 22:12:30,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:12:30,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:31,106 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:31,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:31,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920710848] [2025-04-13 22:12:31,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920710848] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:12:31,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:12:31,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:12:31,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476304099] [2025-04-13 22:12:31,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:31,106 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:12:31,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:31,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:12:31,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:12:31,107 INFO L87 Difference]: Start difference. First operand 63 states and 130 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:31,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:31,345 INFO L93 Difference]: Finished difference Result 96 states and 194 transitions. [2025-04-13 22:12:31,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:12:31,345 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 22:12:31,345 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:31,346 INFO L225 Difference]: With dead ends: 96 [2025-04-13 22:12:31,346 INFO L226 Difference]: Without dead ends: 91 [2025-04-13 22:12:31,346 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:12:31,346 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:31,347 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-04-13 22:12:31,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 61. [2025-04-13 22:12:31,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 2.05) internal successors, (123), 60 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:31,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 123 transitions. [2025-04-13 22:12:31,356 INFO L79 Accepts]: Start accepts. Automaton has 61 states and 123 transitions. Word has length 24 [2025-04-13 22:12:31,356 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:31,356 INFO L485 AbstractCegarLoop]: Abstraction has 61 states and 123 transitions. [2025-04-13 22:12:31,357 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:31,357 INFO L278 IsEmpty]: Start isEmpty. Operand 61 states and 123 transitions. [2025-04-13 22:12:31,357 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 22:12:31,357 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:31,357 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:31,357 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 22:12:31,357 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:31,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:31,358 INFO L85 PathProgramCache]: Analyzing trace with hash -834509539, now seen corresponding path program 8 times [2025-04-13 22:12:31,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:31,358 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167765296] [2025-04-13 22:12:31,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:12:31,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:31,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 22:12:31,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 24 statements. [2025-04-13 22:12:31,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:12:31,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:31,752 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:31,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:31,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167765296] [2025-04-13 22:12:31,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167765296] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:12:31,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:12:31,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:12:31,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959000992] [2025-04-13 22:12:31,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:31,753 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:12:31,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:31,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:12:31,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:12:31,754 INFO L87 Difference]: Start difference. First operand 61 states and 123 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:32,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:32,081 INFO L93 Difference]: Finished difference Result 87 states and 178 transitions. [2025-04-13 22:12:32,081 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:12:32,081 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 22:12:32,081 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:32,082 INFO L225 Difference]: With dead ends: 87 [2025-04-13 22:12:32,082 INFO L226 Difference]: Without dead ends: 82 [2025-04-13 22:12:32,082 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:12:32,082 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:32,082 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:32,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-04-13 22:12:32,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2025-04-13 22:12:32,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 2.032258064516129) internal successors, (126), 62 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:32,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 126 transitions. [2025-04-13 22:12:32,091 INFO L79 Accepts]: Start accepts. Automaton has 63 states and 126 transitions. Word has length 24 [2025-04-13 22:12:32,092 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:32,092 INFO L485 AbstractCegarLoop]: Abstraction has 63 states and 126 transitions. [2025-04-13 22:12:32,092 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:32,092 INFO L278 IsEmpty]: Start isEmpty. Operand 63 states and 126 transitions. [2025-04-13 22:12:32,093 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:12:32,093 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:32,093 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:32,093 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 22:12:32,093 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:32,094 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:32,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1967298272, now seen corresponding path program 1 times [2025-04-13 22:12:32,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:32,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949539908] [2025-04-13 22:12:32,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:12:32,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:32,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 22:12:32,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:12:32,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:12:32,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:32,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:32,515 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949539908] [2025-04-13 22:12:32,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949539908] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:32,515 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141513248] [2025-04-13 22:12:32,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:12:32,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:32,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:32,518 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:12:32,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 22:12:32,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 22:12:32,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:12:32,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:12:32,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:32,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:12:32,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:32,677 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:32,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:32,832 INFO L325 Elim1Store]: treesize reduction 11, result has 84.1 percent of original size [2025-04-13 22:12:32,833 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 70 [2025-04-13 22:12:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:32,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141513248] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:12:32,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:12:32,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2025-04-13 22:12:32,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541039075] [2025-04-13 22:12:32,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:12:32,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:12:32,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:32,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:12:32,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:12:32,875 INFO L87 Difference]: Start difference. First operand 63 states and 126 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:33,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:33,012 INFO L93 Difference]: Finished difference Result 87 states and 178 transitions. [2025-04-13 22:12:33,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:12:33,012 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 22:12:33,012 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:33,013 INFO L225 Difference]: With dead ends: 87 [2025-04-13 22:12:33,013 INFO L226 Difference]: Without dead ends: 80 [2025-04-13 22:12:33,013 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:12:33,014 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:33,014 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:33,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-04-13 22:12:33,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 60. [2025-04-13 22:12:33,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 2.135593220338983) internal successors, (126), 59 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:33,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 126 transitions. [2025-04-13 22:12:33,029 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 126 transitions. Word has length 25 [2025-04-13 22:12:33,029 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:33,029 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 126 transitions. [2025-04-13 22:12:33,029 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:33,029 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 126 transitions. [2025-04-13 22:12:33,031 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:12:33,031 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:33,031 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:33,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 22:12:33,232 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:33,232 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:33,232 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:33,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2110057471, now seen corresponding path program 1 times [2025-04-13 22:12:33,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:33,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003589933] [2025-04-13 22:12:33,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:12:33,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:33,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 22:12:33,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:12:33,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:12:33,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:33,682 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:33,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:33,682 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003589933] [2025-04-13 22:12:33,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003589933] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:12:33,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:12:33,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:12:33,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203427948] [2025-04-13 22:12:33,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:33,683 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:12:33,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:33,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:12:33,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:12:33,683 INFO L87 Difference]: Start difference. First operand 60 states and 126 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:33,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:33,804 INFO L93 Difference]: Finished difference Result 88 states and 176 transitions. [2025-04-13 22:12:33,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:12:33,805 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 22:12:33,805 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:33,805 INFO L225 Difference]: With dead ends: 88 [2025-04-13 22:12:33,805 INFO L226 Difference]: Without dead ends: 72 [2025-04-13 22:12:33,806 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:12:33,806 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:33,806 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-13 22:12:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2025-04-13 22:12:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 2.0677966101694913) internal successors, (122), 59 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:33,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 122 transitions. [2025-04-13 22:12:33,818 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 122 transitions. Word has length 25 [2025-04-13 22:12:33,818 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:33,818 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 122 transitions. [2025-04-13 22:12:33,818 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:33,818 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 122 transitions. [2025-04-13 22:12:33,818 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:12:33,818 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:33,818 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:33,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 22:12:33,818 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:33,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:33,819 INFO L85 PathProgramCache]: Analyzing trace with hash -426820110, now seen corresponding path program 2 times [2025-04-13 22:12:33,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:33,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263686191] [2025-04-13 22:12:33,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:12:33,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:33,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:12:33,860 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:12:33,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:12:33,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:34,166 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:34,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:34,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263686191] [2025-04-13 22:12:34,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263686191] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:34,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906625972] [2025-04-13 22:12:34,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:12:34,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:34,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:34,168 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:12:34,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 22:12:34,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:12:34,259 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:12:34,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:12:34,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:34,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 22:12:34,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:34,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:34,466 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:12:34,466 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 22:12:34,525 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:34,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906625972] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:12:34,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:12:34,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 11 [2025-04-13 22:12:34,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750429151] [2025-04-13 22:12:34,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:12:34,526 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:12:34,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:34,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:12:34,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:12:34,527 INFO L87 Difference]: Start difference. First operand 60 states and 122 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:34,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:34,686 INFO L93 Difference]: Finished difference Result 95 states and 193 transitions. [2025-04-13 22:12:34,686 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:12:34,686 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 22:12:34,686 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:34,687 INFO L225 Difference]: With dead ends: 95 [2025-04-13 22:12:34,687 INFO L226 Difference]: Without dead ends: 88 [2025-04-13 22:12:34,687 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:12:34,687 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:34,688 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:34,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-13 22:12:34,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 62. [2025-04-13 22:12:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 2.1147540983606556) internal successors, (129), 61 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:34,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 129 transitions. [2025-04-13 22:12:34,699 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 129 transitions. Word has length 25 [2025-04-13 22:12:34,699 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:34,699 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 129 transitions. [2025-04-13 22:12:34,699 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:34,699 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 129 transitions. [2025-04-13 22:12:34,700 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:12:34,700 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:34,700 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:34,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 22:12:34,900 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:34,901 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:34,901 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:34,901 INFO L85 PathProgramCache]: Analyzing trace with hash -340932657, now seen corresponding path program 2 times [2025-04-13 22:12:34,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:34,901 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691857611] [2025-04-13 22:12:34,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:12:34,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:34,914 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:12:34,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:12:34,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:12:34,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:35,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:35,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691857611] [2025-04-13 22:12:35,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691857611] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:35,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484008650] [2025-04-13 22:12:35,274 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:12:35,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:35,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:35,277 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:12:35,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 22:12:35,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:12:35,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:12:35,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:12:35,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:35,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 22:12:35,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:35,453 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:35,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:35,559 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:12:35,560 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 22:12:35,616 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:35,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484008650] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:12:35,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:12:35,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 11 [2025-04-13 22:12:35,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242198025] [2025-04-13 22:12:35,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:12:35,617 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:12:35,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:35,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:12:35,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:12:35,617 INFO L87 Difference]: Start difference. First operand 62 states and 129 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:35,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:35,744 INFO L93 Difference]: Finished difference Result 88 states and 184 transitions. [2025-04-13 22:12:35,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:12:35,744 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 22:12:35,744 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:35,746 INFO L225 Difference]: With dead ends: 88 [2025-04-13 22:12:35,746 INFO L226 Difference]: Without dead ends: 80 [2025-04-13 22:12:35,746 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:12:35,747 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:35,747 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:35,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-04-13 22:12:35,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 64. [2025-04-13 22:12:35,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 2.1587301587301586) internal successors, (136), 63 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:35,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 136 transitions. [2025-04-13 22:12:35,759 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 136 transitions. Word has length 25 [2025-04-13 22:12:35,760 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:35,760 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 136 transitions. [2025-04-13 22:12:35,760 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:35,760 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 136 transitions. [2025-04-13 22:12:35,760 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:12:35,760 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:35,760 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:35,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 22:12:35,960 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 22:12:35,961 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:35,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:35,961 INFO L85 PathProgramCache]: Analyzing trace with hash -313489380, now seen corresponding path program 3 times [2025-04-13 22:12:35,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:35,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098956853] [2025-04-13 22:12:35,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:12:35,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:35,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 4 equivalence classes. [2025-04-13 22:12:35,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 25 statements. [2025-04-13 22:12:35,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:12:35,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:36,237 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:36,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:36,237 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098956853] [2025-04-13 22:12:36,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098956853] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:12:36,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:12:36,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:12:36,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427651233] [2025-04-13 22:12:36,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:36,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:12:36,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:36,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:12:36,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:12:36,238 INFO L87 Difference]: Start difference. First operand 64 states and 136 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:36,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:36,341 INFO L93 Difference]: Finished difference Result 85 states and 174 transitions. [2025-04-13 22:12:36,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:12:36,342 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 22:12:36,342 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:36,342 INFO L225 Difference]: With dead ends: 85 [2025-04-13 22:12:36,342 INFO L226 Difference]: Without dead ends: 76 [2025-04-13 22:12:36,343 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:12:36,343 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:36,343 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:36,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-04-13 22:12:36,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2025-04-13 22:12:36,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 2.126984126984127) internal successors, (134), 63 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:36,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 134 transitions. [2025-04-13 22:12:36,351 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 134 transitions. Word has length 25 [2025-04-13 22:12:36,352 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:36,352 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 134 transitions. [2025-04-13 22:12:36,352 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:36,352 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 134 transitions. [2025-04-13 22:12:36,352 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:12:36,352 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:36,352 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:36,352 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 22:12:36,352 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:36,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:36,352 INFO L85 PathProgramCache]: Analyzing trace with hash -213917828, now seen corresponding path program 4 times [2025-04-13 22:12:36,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:36,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399196706] [2025-04-13 22:12:36,353 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:12:36,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:36,368 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:12:36,373 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 12 of 25 statements. [2025-04-13 22:12:36,373 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:12:36,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:36,463 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:36,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:36,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399196706] [2025-04-13 22:12:36,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399196706] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:36,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723438444] [2025-04-13 22:12:36,464 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:12:36,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:36,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:36,466 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:12:36,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 22:12:36,530 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:12:36,538 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 12 of 25 statements. [2025-04-13 22:12:36,538 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:12:36,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:36,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:12:36,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:36,579 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:36,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:36,686 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:12:36,686 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 22:12:36,720 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:36,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723438444] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:12:36,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:12:36,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-13 22:12:36,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196108299] [2025-04-13 22:12:36,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:12:36,720 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:12:36,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:36,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:12:36,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:12:36,721 INFO L87 Difference]: Start difference. First operand 64 states and 134 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:36,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:36,822 INFO L93 Difference]: Finished difference Result 85 states and 172 transitions. [2025-04-13 22:12:36,822 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:12:36,822 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 22:12:36,822 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:36,822 INFO L225 Difference]: With dead ends: 85 [2025-04-13 22:12:36,823 INFO L226 Difference]: Without dead ends: 78 [2025-04-13 22:12:36,824 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:12:36,824 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:36,824 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:36,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-04-13 22:12:36,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2025-04-13 22:12:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 2.126984126984127) internal successors, (134), 63 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 134 transitions. [2025-04-13 22:12:36,836 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 134 transitions. Word has length 25 [2025-04-13 22:12:36,836 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:36,836 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 134 transitions. [2025-04-13 22:12:36,836 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:36,836 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 134 transitions. [2025-04-13 22:12:36,836 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:12:36,836 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:36,836 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:36,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 22:12:37,036 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 22:12:37,037 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:37,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:37,037 INFO L85 PathProgramCache]: Analyzing trace with hash -128030375, now seen corresponding path program 3 times [2025-04-13 22:12:37,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:37,037 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908485096] [2025-04-13 22:12:37,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:12:37,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:37,046 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 4 equivalence classes. [2025-04-13 22:12:37,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 25 statements. [2025-04-13 22:12:37,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:12:37,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:37,309 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:37,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:37,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908485096] [2025-04-13 22:12:37,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908485096] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:37,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348426994] [2025-04-13 22:12:37,310 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:12:37,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:37,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:37,312 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:12:37,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 22:12:37,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 4 equivalence classes. [2025-04-13 22:12:37,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 25 statements. [2025-04-13 22:12:37,400 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:12:37,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:37,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 22:12:37,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:37,462 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:37,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:37,554 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:12:37,555 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 22:12:37,596 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:37,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348426994] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:12:37,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:12:37,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 11 [2025-04-13 22:12:37,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329401870] [2025-04-13 22:12:37,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:12:37,596 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:12:37,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:37,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:12:37,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:12:37,597 INFO L87 Difference]: Start difference. First operand 64 states and 134 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:37,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:37,706 INFO L93 Difference]: Finished difference Result 85 states and 172 transitions. [2025-04-13 22:12:37,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:12:37,706 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 22:12:37,706 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:37,707 INFO L225 Difference]: With dead ends: 85 [2025-04-13 22:12:37,707 INFO L226 Difference]: Without dead ends: 77 [2025-04-13 22:12:37,707 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:12:37,707 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:37,708 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:37,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-13 22:12:37,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 64. [2025-04-13 22:12:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 2.126984126984127) internal successors, (134), 63 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 134 transitions. [2025-04-13 22:12:37,719 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 134 transitions. Word has length 25 [2025-04-13 22:12:37,719 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:37,720 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 134 transitions. [2025-04-13 22:12:37,720 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:37,720 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 134 transitions. [2025-04-13 22:12:37,720 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:12:37,720 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:37,720 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:37,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 22:12:37,920 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:37,921 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:37,921 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:37,921 INFO L85 PathProgramCache]: Analyzing trace with hash -100587098, now seen corresponding path program 5 times [2025-04-13 22:12:37,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:37,921 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422582141] [2025-04-13 22:12:37,921 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:12:37,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:37,931 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 4 equivalence classes. [2025-04-13 22:12:37,965 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:12:37,965 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:12:37,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:12:38,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:38,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422582141] [2025-04-13 22:12:38,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422582141] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:38,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833728491] [2025-04-13 22:12:38,333 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:12:38,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:38,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:38,335 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:12:38,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 22:12:38,405 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 4 equivalence classes. [2025-04-13 22:12:38,451 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:12:38,452 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:12:38,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:38,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 22:12:38,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:38,496 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:38,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:12:38,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833728491] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:12:38,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:12:38,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-04-13 22:12:38,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852179469] [2025-04-13 22:12:38,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:38,496 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:12:38,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:38,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:12:38,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:12:38,497 INFO L87 Difference]: Start difference. First operand 64 states and 134 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:38,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:38,570 INFO L93 Difference]: Finished difference Result 82 states and 158 transitions. [2025-04-13 22:12:38,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:12:38,570 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 22:12:38,570 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:38,571 INFO L225 Difference]: With dead ends: 82 [2025-04-13 22:12:38,571 INFO L226 Difference]: Without dead ends: 73 [2025-04-13 22:12:38,571 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:12:38,572 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:38,572 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:38,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-04-13 22:12:38,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 62. [2025-04-13 22:12:38,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 2.081967213114754) internal successors, (127), 61 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 127 transitions. [2025-04-13 22:12:38,582 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 127 transitions. Word has length 25 [2025-04-13 22:12:38,582 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:38,582 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 127 transitions. [2025-04-13 22:12:38,582 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:38,582 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 127 transitions. [2025-04-13 22:12:38,582 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:12:38,582 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:38,582 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:38,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 22:12:38,784 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 22:12:38,785 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:38,785 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:38,785 INFO L85 PathProgramCache]: Analyzing trace with hash -987499551, now seen corresponding path program 4 times [2025-04-13 22:12:38,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:38,785 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133895454] [2025-04-13 22:12:38,785 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:12:38,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:38,795 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:12:38,798 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 12 of 25 statements. [2025-04-13 22:12:38,798 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:12:38,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:38,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:38,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133895454] [2025-04-13 22:12:38,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133895454] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:38,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176726731] [2025-04-13 22:12:38,883 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:12:38,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:38,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:38,885 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:12:38,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 22:12:38,961 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:12:38,968 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 12 of 25 statements. [2025-04-13 22:12:38,968 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:12:38,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:38,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:12:38,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:38,991 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:38,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:39,096 INFO L325 Elim1Store]: treesize reduction 11, result has 84.1 percent of original size [2025-04-13 22:12:39,096 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 70 [2025-04-13 22:12:39,128 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:39,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176726731] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:12:39,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:12:39,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-04-13 22:12:39,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946862856] [2025-04-13 22:12:39,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:12:39,128 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:12:39,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:39,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:12:39,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:12:39,129 INFO L87 Difference]: Start difference. First operand 62 states and 127 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:39,232 INFO L93 Difference]: Finished difference Result 83 states and 165 transitions. [2025-04-13 22:12:39,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:12:39,232 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 22:12:39,232 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:39,233 INFO L225 Difference]: With dead ends: 83 [2025-04-13 22:12:39,233 INFO L226 Difference]: Without dead ends: 75 [2025-04-13 22:12:39,233 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:12:39,233 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:39,234 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 0 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:39,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-13 22:12:39,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2025-04-13 22:12:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 2.1016949152542375) internal successors, (124), 59 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 124 transitions. [2025-04-13 22:12:39,243 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 124 transitions. Word has length 25 [2025-04-13 22:12:39,243 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:39,243 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 124 transitions. [2025-04-13 22:12:39,243 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:39,243 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 124 transitions. [2025-04-13 22:12:39,243 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:12:39,243 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:39,244 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:39,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 22:12:39,444 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 22:12:39,444 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:39,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:39,445 INFO L85 PathProgramCache]: Analyzing trace with hash -101181744, now seen corresponding path program 6 times [2025-04-13 22:12:39,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:39,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88863623] [2025-04-13 22:12:39,445 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:12:39,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:39,457 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 4 equivalence classes. [2025-04-13 22:12:39,472 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 25 statements. [2025-04-13 22:12:39,472 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:12:39,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:39,766 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:39,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:39,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88863623] [2025-04-13 22:12:39,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88863623] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:12:39,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:12:39,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:12:39,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352871689] [2025-04-13 22:12:39,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:12:39,767 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:12:39,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:39,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:12:39,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:12:39,767 INFO L87 Difference]: Start difference. First operand 60 states and 124 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:39,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:39,896 INFO L93 Difference]: Finished difference Result 71 states and 139 transitions. [2025-04-13 22:12:39,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:12:39,897 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 22:12:39,897 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:39,897 INFO L225 Difference]: With dead ends: 71 [2025-04-13 22:12:39,897 INFO L226 Difference]: Without dead ends: 60 [2025-04-13 22:12:39,898 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:12:39,898 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:39,898 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:12:39,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-13 22:12:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-04-13 22:12:39,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 2.0677966101694913) internal successors, (122), 59 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:39,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 122 transitions. [2025-04-13 22:12:39,906 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 122 transitions. Word has length 25 [2025-04-13 22:12:39,906 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:39,906 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 122 transitions. [2025-04-13 22:12:39,906 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:39,906 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 122 transitions. [2025-04-13 22:12:39,906 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:12:39,906 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:39,906 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:39,907 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 22:12:39,907 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:39,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:39,907 INFO L85 PathProgramCache]: Analyzing trace with hash 856670560, now seen corresponding path program 1 times [2025-04-13 22:12:39,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:39,907 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279582866] [2025-04-13 22:12:39,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:12:39,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:39,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 22:12:39,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:12:39,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:12:39,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:12:40,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:40,582 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279582866] [2025-04-13 22:12:40,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279582866] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:40,582 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438352552] [2025-04-13 22:12:40,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:12:40,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:40,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:40,584 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:12:40,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 22:12:40,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 22:12:40,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:12:40,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:12:40,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:40,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 22:12:40,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:40,933 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:12:40,933 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:12:40,965 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:40,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:41,288 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:12:41,288 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 195 [2025-04-13 22:12:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:41,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438352552] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:12:41,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:12:41,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 27 [2025-04-13 22:12:41,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457285049] [2025-04-13 22:12:41,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:12:41,920 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:12:41,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:41,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:12:41,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:12:41,921 INFO L87 Difference]: Start difference. First operand 60 states and 122 transitions. Second operand has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:42,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:42,955 INFO L93 Difference]: Finished difference Result 115 states and 234 transitions. [2025-04-13 22:12:42,956 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:12:42,956 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:12:42,956 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:42,957 INFO L225 Difference]: With dead ends: 115 [2025-04-13 22:12:42,957 INFO L226 Difference]: Without dead ends: 92 [2025-04-13 22:12:42,958 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=343, Invalid=2207, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:12:42,958 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 169 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:42,958 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 0 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:12:42,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-13 22:12:42,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 64. [2025-04-13 22:12:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 63 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:42,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 131 transitions. [2025-04-13 22:12:42,971 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 131 transitions. Word has length 26 [2025-04-13 22:12:42,971 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:42,971 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 131 transitions. [2025-04-13 22:12:42,971 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:42,971 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 131 transitions. [2025-04-13 22:12:42,972 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:12:42,972 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:42,973 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:42,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 22:12:43,176 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:43,176 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:43,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:43,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1643474718, now seen corresponding path program 2 times [2025-04-13 22:12:43,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:43,177 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759442547] [2025-04-13 22:12:43,177 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:12:43,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:43,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:12:43,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:12:43,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:12:43,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:43,704 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:43,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:43,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759442547] [2025-04-13 22:12:43,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759442547] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:43,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988852101] [2025-04-13 22:12:43,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:12:43,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:43,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:43,706 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:12:43,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 22:12:43,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:12:43,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:12:43,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:12:43,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:43,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:12:43,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:44,023 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:12:44,024 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:12:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:12:44,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:44,474 INFO L325 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2025-04-13 22:12:44,474 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 134 treesize of output 190 [2025-04-13 22:12:45,196 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:45,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988852101] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:12:45,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:12:45,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 21 [2025-04-13 22:12:45,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120765434] [2025-04-13 22:12:45,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:12:45,197 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:12:45,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:45,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:12:45,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:12:45,197 INFO L87 Difference]: Start difference. First operand 64 states and 131 transitions. Second operand has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:46,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:46,121 INFO L93 Difference]: Finished difference Result 154 states and 334 transitions. [2025-04-13 22:12:46,122 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:12:46,122 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:12:46,122 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:46,123 INFO L225 Difference]: With dead ends: 154 [2025-04-13 22:12:46,123 INFO L226 Difference]: Without dead ends: 132 [2025-04-13 22:12:46,123 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=296, Invalid=1510, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:12:46,124 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 157 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:46,124 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 0 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:12:46,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-04-13 22:12:46,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 75. [2025-04-13 22:12:46,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 2.175675675675676) internal successors, (161), 74 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:46,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 161 transitions. [2025-04-13 22:12:46,138 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 161 transitions. Word has length 26 [2025-04-13 22:12:46,138 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:46,138 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 161 transitions. [2025-04-13 22:12:46,138 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:46,138 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 161 transitions. [2025-04-13 22:12:46,139 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:12:46,139 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:46,139 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:46,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 22:12:46,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-13 22:12:46,339 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:46,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:46,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1594319568, now seen corresponding path program 3 times [2025-04-13 22:12:46,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:46,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694225722] [2025-04-13 22:12:46,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:12:46,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:46,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:12:46,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 26 statements. [2025-04-13 22:12:46,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:12:46,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:46,671 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:46,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:46,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694225722] [2025-04-13 22:12:46,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694225722] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:46,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188032504] [2025-04-13 22:12:46,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:12:46,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:46,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:46,674 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:12:46,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 22:12:46,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:12:46,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 26 statements. [2025-04-13 22:12:46,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:12:46,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:46,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:12:46,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:46,975 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:12:46,975 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:12:46,997 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:46,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:47,392 INFO L325 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2025-04-13 22:12:47,393 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 134 treesize of output 190 [2025-04-13 22:12:48,153 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:48,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188032504] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:12:48,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:12:48,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 20 [2025-04-13 22:12:48,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439258558] [2025-04-13 22:12:48,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:12:48,154 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:12:48,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:48,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:12:48,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:12:48,155 INFO L87 Difference]: Start difference. First operand 75 states and 161 transitions. Second operand has 21 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:49,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:49,978 INFO L93 Difference]: Finished difference Result 241 states and 488 transitions. [2025-04-13 22:12:49,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 22:12:49,979 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:12:49,979 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:49,980 INFO L225 Difference]: With dead ends: 241 [2025-04-13 22:12:49,980 INFO L226 Difference]: Without dead ends: 210 [2025-04-13 22:12:49,980 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=544, Invalid=2318, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:12:49,981 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 188 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:49,981 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 0 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:12:49,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-04-13 22:12:50,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 81. [2025-04-13 22:12:50,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 2.325) internal successors, (186), 80 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 186 transitions. [2025-04-13 22:12:50,003 INFO L79 Accepts]: Start accepts. Automaton has 81 states and 186 transitions. Word has length 26 [2025-04-13 22:12:50,004 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:50,004 INFO L485 AbstractCegarLoop]: Abstraction has 81 states and 186 transitions. [2025-04-13 22:12:50,004 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:50,004 INFO L278 IsEmpty]: Start isEmpty. Operand 81 states and 186 transitions. [2025-04-13 22:12:50,004 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:12:50,004 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:50,004 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:50,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 22:12:50,205 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-13 22:12:50,205 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:50,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:50,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1591811358, now seen corresponding path program 4 times [2025-04-13 22:12:50,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:50,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860385600] [2025-04-13 22:12:50,206 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:12:50,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:50,213 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:12:50,217 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 26 statements. [2025-04-13 22:12:50,217 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:12:50,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:50,376 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:50,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:50,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860385600] [2025-04-13 22:12:50,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860385600] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:50,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522488673] [2025-04-13 22:12:50,376 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:12:50,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:50,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:50,378 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:12:50,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 22:12:50,497 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:12:50,509 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 26 statements. [2025-04-13 22:12:50,509 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:12:50,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:50,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 22:12:50,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:50,606 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:12:50,607 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:12:50,631 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:50,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:50,731 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:12:50,731 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 22:12:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:51,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522488673] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:12:51,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:12:51,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-13 22:12:51,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760610081] [2025-04-13 22:12:51,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:12:51,226 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 22:12:51,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:51,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 22:12:51,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:12:51,227 INFO L87 Difference]: Start difference. First operand 81 states and 186 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:51,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:51,784 INFO L93 Difference]: Finished difference Result 189 states and 435 transitions. [2025-04-13 22:12:51,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:12:51,785 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:12:51,785 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:51,785 INFO L225 Difference]: With dead ends: 189 [2025-04-13 22:12:51,786 INFO L226 Difference]: Without dead ends: 172 [2025-04-13 22:12:51,786 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:12:51,786 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:51,786 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:12:51,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-04-13 22:12:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 95. [2025-04-13 22:12:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 2.5425531914893615) internal successors, (239), 94 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 239 transitions. [2025-04-13 22:12:51,813 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 239 transitions. Word has length 26 [2025-04-13 22:12:51,813 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:51,813 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 239 transitions. [2025-04-13 22:12:51,813 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:51,813 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 239 transitions. [2025-04-13 22:12:51,813 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:12:51,813 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:51,814 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:51,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 22:12:52,014 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-13 22:12:52,014 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:52,014 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:52,014 INFO L85 PathProgramCache]: Analyzing trace with hash -346555250, now seen corresponding path program 5 times [2025-04-13 22:12:52,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:52,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426549296] [2025-04-13 22:12:52,015 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:12:52,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:52,023 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:12:52,040 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:12:52,040 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:12:52,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:12:52,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:52,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426549296] [2025-04-13 22:12:52,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426549296] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:52,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779204246] [2025-04-13 22:12:52,430 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:12:52,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:52,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:52,433 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:12:52,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 22:12:52,519 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:12:52,584 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:12:52,584 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:12:52,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:52,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:12:52,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:52,732 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:12:52,732 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 22:12:52,753 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:52,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:52,893 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:12:52,894 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 193 [2025-04-13 22:12:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:53,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779204246] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:12:53,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:12:53,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 21 [2025-04-13 22:12:53,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592721640] [2025-04-13 22:12:53,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:12:53,254 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:12:53,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:53,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:12:53,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:12:53,254 INFO L87 Difference]: Start difference. First operand 95 states and 239 transitions. Second operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:53,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:53,898 INFO L93 Difference]: Finished difference Result 154 states and 361 transitions. [2025-04-13 22:12:53,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:12:53,898 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:12:53,898 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:53,899 INFO L225 Difference]: With dead ends: 154 [2025-04-13 22:12:53,899 INFO L226 Difference]: Without dead ends: 132 [2025-04-13 22:12:53,899 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=1727, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:12:53,899 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:53,900 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 0 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:12:53,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-04-13 22:12:53,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 98. [2025-04-13 22:12:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.5257731958762886) internal successors, (245), 97 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 245 transitions. [2025-04-13 22:12:53,928 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 245 transitions. Word has length 26 [2025-04-13 22:12:53,928 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:53,928 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 245 transitions. [2025-04-13 22:12:53,928 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:53,928 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 245 transitions. [2025-04-13 22:12:53,928 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:12:53,928 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:53,928 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:53,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 22:12:54,133 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:54,133 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:54,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:54,133 INFO L85 PathProgramCache]: Analyzing trace with hash -297400100, now seen corresponding path program 6 times [2025-04-13 22:12:54,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:54,134 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243498526] [2025-04-13 22:12:54,134 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:12:54,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:54,141 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:12:54,154 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 26 statements. [2025-04-13 22:12:54,154 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:12:54,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:54,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:54,463 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243498526] [2025-04-13 22:12:54,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243498526] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:54,463 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317153207] [2025-04-13 22:12:54,463 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:12:54,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:54,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:54,465 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:12:54,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 22:12:54,556 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:12:54,578 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 26 statements. [2025-04-13 22:12:54,578 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:12:54,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:54,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:12:54,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:54,877 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:12:54,877 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:12:54,902 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:54,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:55,069 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:12:55,070 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 210 treesize of output 206 [2025-04-13 22:12:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:56,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317153207] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:12:56,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:12:56,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 24 [2025-04-13 22:12:56,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495564911] [2025-04-13 22:12:56,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:12:56,346 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:12:56,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:56,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:12:56,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:12:56,346 INFO L87 Difference]: Start difference. First operand 98 states and 245 transitions. Second operand has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:57,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:57,237 INFO L93 Difference]: Finished difference Result 169 states and 383 transitions. [2025-04-13 22:12:57,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:12:57,237 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:12:57,237 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:57,238 INFO L225 Difference]: With dead ends: 169 [2025-04-13 22:12:57,238 INFO L226 Difference]: Without dead ends: 138 [2025-04-13 22:12:57,239 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=295, Invalid=1511, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:12:57,239 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 133 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:57,239 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 0 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:12:57,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-04-13 22:12:57,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 99. [2025-04-13 22:12:57,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 2.5408163265306123) internal successors, (249), 98 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 249 transitions. [2025-04-13 22:12:57,294 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 249 transitions. Word has length 26 [2025-04-13 22:12:57,294 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:57,294 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 249 transitions. [2025-04-13 22:12:57,294 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:57,295 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 249 transitions. [2025-04-13 22:12:57,295 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:12:57,295 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:57,295 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:57,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-13 22:12:57,499 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:57,499 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:57,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:57,499 INFO L85 PathProgramCache]: Analyzing trace with hash -2015743806, now seen corresponding path program 7 times [2025-04-13 22:12:57,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:57,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082969767] [2025-04-13 22:12:57,499 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:12:57,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:57,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 22:12:57,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:12:57,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:12:57,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:12:58,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:12:58,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082969767] [2025-04-13 22:12:58,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082969767] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:12:58,111 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892672470] [2025-04-13 22:12:58,111 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:12:58,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:58,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:58,112 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:12:58,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 22:12:58,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 22:12:58,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:12:58,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:12:58,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:12:58,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 22:12:58,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:12:58,367 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:12:58,367 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:12:58,392 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:58,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:12:58,524 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:12:58,524 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 191 [2025-04-13 22:12:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:12:59,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892672470] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:12:59,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:12:59,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 25 [2025-04-13 22:12:59,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255719536] [2025-04-13 22:12:59,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:12:59,015 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:12:59,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:12:59,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:12:59,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:12:59,016 INFO L87 Difference]: Start difference. First operand 99 states and 249 transitions. Second operand has 26 states, 25 states have (on average 1.84) internal successors, (46), 26 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:59,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:12:59,723 INFO L93 Difference]: Finished difference Result 175 states and 403 transitions. [2025-04-13 22:12:59,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:12:59,724 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.84) internal successors, (46), 26 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:12:59,724 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:12:59,725 INFO L225 Difference]: With dead ends: 175 [2025-04-13 22:12:59,725 INFO L226 Difference]: Without dead ends: 150 [2025-04-13 22:12:59,725 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=2059, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:12:59,726 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 149 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:59,726 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 0 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:12:59,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-04-13 22:12:59,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 107. [2025-04-13 22:12:59,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 2.650943396226415) internal successors, (281), 106 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:59,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 281 transitions. [2025-04-13 22:12:59,762 INFO L79 Accepts]: Start accepts. Automaton has 107 states and 281 transitions. Word has length 26 [2025-04-13 22:12:59,763 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:12:59,763 INFO L485 AbstractCegarLoop]: Abstraction has 107 states and 281 transitions. [2025-04-13 22:12:59,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.84) internal successors, (46), 26 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:59,763 INFO L278 IsEmpty]: Start isEmpty. Operand 107 states and 281 transitions. [2025-04-13 22:12:59,763 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:12:59,763 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:12:59,763 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:59,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-13 22:12:59,963 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 22:12:59,964 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:12:59,964 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:12:59,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2013235596, now seen corresponding path program 8 times [2025-04-13 22:12:59,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:12:59,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680884138] [2025-04-13 22:12:59,964 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:12:59,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:12:59,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:12:59,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:12:59,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:12:59,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:00,389 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:00,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:00,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680884138] [2025-04-13 22:13:00,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680884138] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:00,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846923762] [2025-04-13 22:13:00,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:00,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:00,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:00,391 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:00,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 22:13:00,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:13:00,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:13:00,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:00,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:00,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:13:00,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:00,648 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:13:00,648 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:13:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:13:00,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:00,792 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:00,793 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 22:13:01,275 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:01,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846923762] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:01,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:01,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 25 [2025-04-13 22:13:01,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305488329] [2025-04-13 22:13:01,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:01,276 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:13:01,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:01,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:13:01,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:13:01,276 INFO L87 Difference]: Start difference. First operand 107 states and 281 transitions. Second operand has 26 states, 25 states have (on average 2.08) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:02,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:02,015 INFO L93 Difference]: Finished difference Result 171 states and 390 transitions. [2025-04-13 22:13:02,015 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:13:02,015 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:13:02,015 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:02,016 INFO L225 Difference]: With dead ends: 171 [2025-04-13 22:13:02,016 INFO L226 Difference]: Without dead ends: 143 [2025-04-13 22:13:02,017 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=375, Invalid=2175, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:13:02,017 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 141 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:02,017 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 0 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:02,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-04-13 22:13:02,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 107. [2025-04-13 22:13:02,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 2.6132075471698113) internal successors, (277), 106 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 277 transitions. [2025-04-13 22:13:02,055 INFO L79 Accepts]: Start accepts. Automaton has 107 states and 277 transitions. Word has length 26 [2025-04-13 22:13:02,055 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:02,055 INFO L485 AbstractCegarLoop]: Abstraction has 107 states and 277 transitions. [2025-04-13 22:13:02,055 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:02,055 INFO L278 IsEmpty]: Start isEmpty. Operand 107 states and 277 transitions. [2025-04-13 22:13:02,056 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:13:02,056 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:02,056 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:02,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-13 22:13:02,256 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 22:13:02,256 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:02,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:02,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1902413076, now seen corresponding path program 9 times [2025-04-13 22:13:02,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:02,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653550769] [2025-04-13 22:13:02,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:02,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:02,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:13:02,274 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 26 statements. [2025-04-13 22:13:02,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:13:02,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:02,551 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:02,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:02,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653550769] [2025-04-13 22:13:02,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653550769] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:02,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075083794] [2025-04-13 22:13:02,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:02,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:02,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:02,553 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:02,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 22:13:02,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:13:02,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 26 statements. [2025-04-13 22:13:02,666 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:13:02,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:02,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:13:02,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:02,850 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:13:02,850 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 42 [2025-04-13 22:13:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:02,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:03,044 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:03,044 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 22:13:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:03,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075083794] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:03,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:03,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 23 [2025-04-13 22:13:03,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059187913] [2025-04-13 22:13:03,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:03,682 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:13:03,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:03,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:13:03,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:13:03,683 INFO L87 Difference]: Start difference. First operand 107 states and 277 transitions. Second operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:04,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:04,319 INFO L93 Difference]: Finished difference Result 147 states and 357 transitions. [2025-04-13 22:13:04,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:13:04,320 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:13:04,320 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:04,321 INFO L225 Difference]: With dead ends: 147 [2025-04-13 22:13:04,321 INFO L226 Difference]: Without dead ends: 125 [2025-04-13 22:13:04,321 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=265, Invalid=1457, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:13:04,322 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 104 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:04,322 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 0 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:04,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-04-13 22:13:04,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2025-04-13 22:13:04,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 2.590909090909091) internal successors, (285), 110 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:04,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 285 transitions. [2025-04-13 22:13:04,380 INFO L79 Accepts]: Start accepts. Automaton has 111 states and 285 transitions. Word has length 26 [2025-04-13 22:13:04,380 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:04,380 INFO L485 AbstractCegarLoop]: Abstraction has 111 states and 285 transitions. [2025-04-13 22:13:04,380 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:04,380 INFO L278 IsEmpty]: Start isEmpty. Operand 111 states and 285 transitions. [2025-04-13 22:13:04,380 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:13:04,380 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:04,380 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:04,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 22:13:04,581 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 22:13:04,581 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:04,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:04,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1958448196, now seen corresponding path program 10 times [2025-04-13 22:13:04,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:04,581 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284943287] [2025-04-13 22:13:04,581 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:04,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:04,592 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:13:04,597 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 26 statements. [2025-04-13 22:13:04,597 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:13:04,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:04,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:04,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284943287] [2025-04-13 22:13:04,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284943287] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:04,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102567389] [2025-04-13 22:13:04,800 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:04,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:04,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:04,801 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:04,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 22:13:04,902 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:13:04,910 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 26 statements. [2025-04-13 22:13:04,910 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:13:04,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:04,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 22:13:04,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:05,026 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:13:05,026 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:13:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:05,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:05,216 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:05,216 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 197 [2025-04-13 22:13:05,669 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:05,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102567389] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:05,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:05,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-13 22:13:05,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754860778] [2025-04-13 22:13:05,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:05,670 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 22:13:05,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:05,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 22:13:05,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:13:05,670 INFO L87 Difference]: Start difference. First operand 111 states and 285 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:06,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:06,390 INFO L93 Difference]: Finished difference Result 192 states and 465 transitions. [2025-04-13 22:13:06,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:13:06,390 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:13:06,390 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:06,391 INFO L225 Difference]: With dead ends: 192 [2025-04-13 22:13:06,391 INFO L226 Difference]: Without dead ends: 166 [2025-04-13 22:13:06,392 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=1200, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:13:06,392 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 134 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:06,392 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 0 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:06,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-04-13 22:13:06,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 120. [2025-04-13 22:13:06,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 2.6554621848739495) internal successors, (316), 119 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:06,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 316 transitions. [2025-04-13 22:13:06,443 INFO L79 Accepts]: Start accepts. Automaton has 120 states and 316 transitions. Word has length 26 [2025-04-13 22:13:06,443 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:06,443 INFO L485 AbstractCegarLoop]: Abstraction has 120 states and 316 transitions. [2025-04-13 22:13:06,443 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:06,443 INFO L278 IsEmpty]: Start isEmpty. Operand 120 states and 316 transitions. [2025-04-13 22:13:06,443 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:13:06,443 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:06,443 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:06,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-13 22:13:06,648 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 22:13:06,648 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:06,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:06,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2010111556, now seen corresponding path program 11 times [2025-04-13 22:13:06,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:06,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411421157] [2025-04-13 22:13:06,648 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:06,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:06,656 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:13:06,678 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:13:06,678 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:06,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:13:07,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:07,317 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411421157] [2025-04-13 22:13:07,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411421157] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:07,317 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30382957] [2025-04-13 22:13:07,317 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:07,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:07,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:07,319 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:07,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 22:13:07,413 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:13:07,456 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:13:07,456 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:07,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:07,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:13:07,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:07,603 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:13:07,603 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 22:13:07,633 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:07,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:07,767 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:07,768 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 22:13:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:08,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30382957] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:08,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:08,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 7] total 26 [2025-04-13 22:13:08,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781426269] [2025-04-13 22:13:08,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:08,165 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:13:08,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:08,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:13:08,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:13:08,166 INFO L87 Difference]: Start difference. First operand 120 states and 316 transitions. Second operand has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 27 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:09,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:09,004 INFO L93 Difference]: Finished difference Result 178 states and 425 transitions. [2025-04-13 22:13:09,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:13:09,004 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 27 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:13:09,004 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:09,005 INFO L225 Difference]: With dead ends: 178 [2025-04-13 22:13:09,005 INFO L226 Difference]: Without dead ends: 161 [2025-04-13 22:13:09,006 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=1889, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:13:09,006 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:09,006 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:13:09,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-04-13 22:13:09,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 122. [2025-04-13 22:13:09,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 2.669421487603306) internal successors, (323), 121 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:09,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 323 transitions. [2025-04-13 22:13:09,056 INFO L79 Accepts]: Start accepts. Automaton has 122 states and 323 transitions. Word has length 26 [2025-04-13 22:13:09,056 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:09,056 INFO L485 AbstractCegarLoop]: Abstraction has 122 states and 323 transitions. [2025-04-13 22:13:09,056 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 27 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:09,056 INFO L278 IsEmpty]: Start isEmpty. Operand 122 states and 323 transitions. [2025-04-13 22:13:09,057 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:13:09,057 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:09,057 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:09,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-13 22:13:09,257 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:09,257 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:09,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:09,258 INFO L85 PathProgramCache]: Analyzing trace with hash 289259640, now seen corresponding path program 12 times [2025-04-13 22:13:09,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:09,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207048587] [2025-04-13 22:13:09,258 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:13:09,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:09,268 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:13:09,279 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 26 statements. [2025-04-13 22:13:09,279 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:13:09,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:09,636 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:09,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:09,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207048587] [2025-04-13 22:13:09,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207048587] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:09,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718374604] [2025-04-13 22:13:09,637 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:13:09,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:09,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:09,639 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:09,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 22:13:09,743 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:13:09,763 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 26 statements. [2025-04-13 22:13:09,763 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:13:09,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:09,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:13:09,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:09,940 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:13:09,941 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:13:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:09,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:10,396 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-13 22:13:10,396 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 225 treesize of output 263 [2025-04-13 22:13:12,484 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:12,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718374604] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:12,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:12,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 19 [2025-04-13 22:13:12,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508436215] [2025-04-13 22:13:12,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:12,485 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:13:12,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:12,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:13:12,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:13:12,485 INFO L87 Difference]: Start difference. First operand 122 states and 323 transitions. Second operand has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:14,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:14,865 INFO L93 Difference]: Finished difference Result 280 states and 655 transitions. [2025-04-13 22:13:14,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 22:13:14,865 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:13:14,865 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:14,866 INFO L225 Difference]: With dead ends: 280 [2025-04-13 22:13:14,866 INFO L226 Difference]: Without dead ends: 253 [2025-04-13 22:13:14,867 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=537, Invalid=3003, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 22:13:14,867 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 220 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:14,868 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 0 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:13:14,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-13 22:13:14,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 138. [2025-04-13 22:13:14,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.81021897810219) internal successors, (385), 137 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 385 transitions. [2025-04-13 22:13:14,936 INFO L79 Accepts]: Start accepts. Automaton has 138 states and 385 transitions. Word has length 26 [2025-04-13 22:13:14,937 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:14,937 INFO L485 AbstractCegarLoop]: Abstraction has 138 states and 385 transitions. [2025-04-13 22:13:14,937 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:14,937 INFO L278 IsEmpty]: Start isEmpty. Operand 138 states and 385 transitions. [2025-04-13 22:13:14,937 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:13:14,937 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:14,937 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:14,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-13 22:13:15,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:15,138 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:15,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:15,138 INFO L85 PathProgramCache]: Analyzing trace with hash 291767850, now seen corresponding path program 13 times [2025-04-13 22:13:15,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:15,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080873367] [2025-04-13 22:13:15,138 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:13:15,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:15,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 22:13:15,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:13:15,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:15,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:15,613 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:13:15,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:15,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080873367] [2025-04-13 22:13:15,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080873367] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:15,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216587881] [2025-04-13 22:13:15,613 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:13:15,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:15,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:15,615 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:15,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 22:13:15,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 22:13:15,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:13:15,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:15,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:15,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 22:13:15,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:15,863 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:13:15,864 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:13:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:15,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:16,012 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:16,012 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 226 treesize of output 222 [2025-04-13 22:13:16,774 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:16,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216587881] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:16,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:16,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 27 [2025-04-13 22:13:16,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502891329] [2025-04-13 22:13:16,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:16,774 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:13:16,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:16,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:13:16,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:13:16,775 INFO L87 Difference]: Start difference. First operand 138 states and 385 transitions. Second operand has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:18,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:18,265 INFO L93 Difference]: Finished difference Result 264 states and 619 transitions. [2025-04-13 22:13:18,265 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 22:13:18,265 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:13:18,265 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:18,266 INFO L225 Difference]: With dead ends: 264 [2025-04-13 22:13:18,266 INFO L226 Difference]: Without dead ends: 225 [2025-04-13 22:13:18,267 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=608, Invalid=4362, Unknown=0, NotChecked=0, Total=4970 [2025-04-13 22:13:18,267 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 203 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:18,268 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 0 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:13:18,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-04-13 22:13:18,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 140. [2025-04-13 22:13:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.79136690647482) internal successors, (388), 139 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:18,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 388 transitions. [2025-04-13 22:13:18,334 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 388 transitions. Word has length 26 [2025-04-13 22:13:18,334 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:18,334 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 388 transitions. [2025-04-13 22:13:18,334 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:18,334 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 388 transitions. [2025-04-13 22:13:18,335 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:13:18,335 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:18,335 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:18,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 22:13:18,535 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:18,535 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:18,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:18,536 INFO L85 PathProgramCache]: Analyzing trace with hash 402590370, now seen corresponding path program 14 times [2025-04-13 22:13:18,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:18,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680146546] [2025-04-13 22:13:18,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:18,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:18,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:13:18,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:13:18,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:18,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:18,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:18,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680146546] [2025-04-13 22:13:18,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680146546] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:18,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707973469] [2025-04-13 22:13:18,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:18,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:18,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:18,896 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:18,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 22:13:18,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:13:19,018 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:13:19,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:19,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:19,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:13:19,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:19,198 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:13:19,199 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:13:19,220 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:13:19,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:19,357 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:19,358 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 22:13:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:19,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707973469] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:19,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:19,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 25 [2025-04-13 22:13:19,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445460825] [2025-04-13 22:13:19,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:19,903 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:13:19,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:19,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:13:19,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:13:19,903 INFO L87 Difference]: Start difference. First operand 140 states and 388 transitions. Second operand has 26 states, 25 states have (on average 2.08) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:20,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:20,657 INFO L93 Difference]: Finished difference Result 199 states and 526 transitions. [2025-04-13 22:13:20,657 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:13:20,657 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:13:20,657 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:20,658 INFO L225 Difference]: With dead ends: 199 [2025-04-13 22:13:20,658 INFO L226 Difference]: Without dead ends: 174 [2025-04-13 22:13:20,658 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=289, Invalid=1781, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:13:20,659 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:20,659 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:20,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-04-13 22:13:20,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 140. [2025-04-13 22:13:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.776978417266187) internal successors, (386), 139 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 386 transitions. [2025-04-13 22:13:20,728 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 386 transitions. Word has length 26 [2025-04-13 22:13:20,728 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:20,728 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 386 transitions. [2025-04-13 22:13:20,728 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:20,728 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 386 transitions. [2025-04-13 22:13:20,728 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:13:20,728 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:20,728 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:20,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-13 22:13:20,929 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:20,929 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:20,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:20,930 INFO L85 PathProgramCache]: Analyzing trace with hash -584481040, now seen corresponding path program 15 times [2025-04-13 22:13:20,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:20,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808032732] [2025-04-13 22:13:20,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:20,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:20,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:13:20,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 26 statements. [2025-04-13 22:13:20,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:13:20,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:21,212 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:21,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:21,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808032732] [2025-04-13 22:13:21,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808032732] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:21,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489643626] [2025-04-13 22:13:21,212 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:21,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:21,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:21,214 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:21,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 22:13:21,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:13:21,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 26 statements. [2025-04-13 22:13:21,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:13:21,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:21,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:13:21,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:21,502 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:13:21,502 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:13:21,523 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:21,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:21,891 INFO L325 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2025-04-13 22:13:21,891 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 138 treesize of output 188 [2025-04-13 22:13:22,867 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:22,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489643626] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:22,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:22,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 20 [2025-04-13 22:13:22,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107730518] [2025-04-13 22:13:22,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:22,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:13:22,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:22,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:13:22,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:13:22,868 INFO L87 Difference]: Start difference. First operand 140 states and 386 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:25,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:25,041 INFO L93 Difference]: Finished difference Result 339 states and 817 transitions. [2025-04-13 22:13:25,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 22:13:25,042 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:13:25,042 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:25,043 INFO L225 Difference]: With dead ends: 339 [2025-04-13 22:13:25,043 INFO L226 Difference]: Without dead ends: 308 [2025-04-13 22:13:25,044 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=654, Invalid=3006, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 22:13:25,044 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 302 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:25,044 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 0 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:13:25,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-04-13 22:13:25,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 146. [2025-04-13 22:13:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 2.820689655172414) internal successors, (409), 145 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:25,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 409 transitions. [2025-04-13 22:13:25,128 INFO L79 Accepts]: Start accepts. Automaton has 146 states and 409 transitions. Word has length 26 [2025-04-13 22:13:25,128 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:25,128 INFO L485 AbstractCegarLoop]: Abstraction has 146 states and 409 transitions. [2025-04-13 22:13:25,128 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:25,128 INFO L278 IsEmpty]: Start isEmpty. Operand 146 states and 409 transitions. [2025-04-13 22:13:25,128 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:13:25,128 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:25,128 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:25,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 22:13:25,329 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:25,329 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:25,329 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:25,329 INFO L85 PathProgramCache]: Analyzing trace with hash -581972830, now seen corresponding path program 16 times [2025-04-13 22:13:25,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:25,329 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564482705] [2025-04-13 22:13:25,329 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:25,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:25,336 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:13:25,339 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 26 statements. [2025-04-13 22:13:25,339 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:13:25,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:25,485 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:25,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:25,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564482705] [2025-04-13 22:13:25,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564482705] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:25,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156199795] [2025-04-13 22:13:25,485 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:25,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:25,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:25,487 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:25,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 22:13:25,604 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:13:25,611 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 26 statements. [2025-04-13 22:13:25,611 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:13:25,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:25,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 22:13:25,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:25,674 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:13:25,675 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:13:25,696 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:25,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:25,816 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:25,816 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 22:13:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:26,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156199795] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:26,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:26,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-13 22:13:26,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272823826] [2025-04-13 22:13:26,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:26,207 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 22:13:26,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:26,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 22:13:26,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:13:26,207 INFO L87 Difference]: Start difference. First operand 146 states and 409 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:26,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:26,861 INFO L93 Difference]: Finished difference Result 247 states and 608 transitions. [2025-04-13 22:13:26,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:13:26,861 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:13:26,861 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:26,862 INFO L225 Difference]: With dead ends: 247 [2025-04-13 22:13:26,862 INFO L226 Difference]: Without dead ends: 230 [2025-04-13 22:13:26,862 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:13:26,863 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 115 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:26,863 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 0 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:26,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-04-13 22:13:26,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 146. [2025-04-13 22:13:26,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 2.806896551724138) internal successors, (407), 145 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:26,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 407 transitions. [2025-04-13 22:13:26,945 INFO L79 Accepts]: Start accepts. Automaton has 146 states and 407 transitions. Word has length 26 [2025-04-13 22:13:26,945 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:26,945 INFO L485 AbstractCegarLoop]: Abstraction has 146 states and 407 transitions. [2025-04-13 22:13:26,945 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:26,945 INFO L278 IsEmpty]: Start isEmpty. Operand 146 states and 407 transitions. [2025-04-13 22:13:26,946 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:13:26,946 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:26,946 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:26,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-13 22:13:27,146 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-04-13 22:13:27,146 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:27,147 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:27,147 INFO L85 PathProgramCache]: Analyzing trace with hash -471150310, now seen corresponding path program 17 times [2025-04-13 22:13:27,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:27,147 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195997495] [2025-04-13 22:13:27,147 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:27,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:27,156 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:13:27,170 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:13:27,170 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:27,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:13:27,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:27,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195997495] [2025-04-13 22:13:27,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195997495] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:27,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973264514] [2025-04-13 22:13:27,719 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:27,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:27,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:27,721 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:27,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 22:13:27,828 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:13:27,872 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:13:27,872 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:27,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:27,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:13:27,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:28,011 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:13:28,011 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 22:13:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:28,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:28,177 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:28,178 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 209 [2025-04-13 22:13:28,525 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:28,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973264514] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:28,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:28,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 7] total 25 [2025-04-13 22:13:28,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412638531] [2025-04-13 22:13:28,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:28,525 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:13:28,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:28,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:13:28,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:13:28,526 INFO L87 Difference]: Start difference. First operand 146 states and 407 transitions. Second operand has 26 states, 25 states have (on average 1.96) internal successors, (49), 26 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:29,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:29,307 INFO L93 Difference]: Finished difference Result 212 states and 558 transitions. [2025-04-13 22:13:29,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:13:29,308 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 26 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:13:29,308 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:29,309 INFO L225 Difference]: With dead ends: 212 [2025-04-13 22:13:29,309 INFO L226 Difference]: Without dead ends: 197 [2025-04-13 22:13:29,309 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:13:29,310 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:29,310 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:13:29,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-04-13 22:13:29,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 146. [2025-04-13 22:13:29,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 2.793103448275862) internal successors, (405), 145 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 405 transitions. [2025-04-13 22:13:29,390 INFO L79 Accepts]: Start accepts. Automaton has 146 states and 405 transitions. Word has length 26 [2025-04-13 22:13:29,390 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:29,390 INFO L485 AbstractCegarLoop]: Abstraction has 146 states and 405 transitions. [2025-04-13 22:13:29,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.96) internal successors, (49), 26 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:29,391 INFO L278 IsEmpty]: Start isEmpty. Operand 146 states and 405 transitions. [2025-04-13 22:13:29,391 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:13:29,391 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:29,391 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:29,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 22:13:29,591 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-04-13 22:13:29,591 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:29,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:29,592 INFO L85 PathProgramCache]: Analyzing trace with hash -471744956, now seen corresponding path program 18 times [2025-04-13 22:13:29,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:29,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394467418] [2025-04-13 22:13:29,592 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:13:29,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:29,601 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:13:29,612 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 26 statements. [2025-04-13 22:13:29,612 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:13:29,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:29,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:29,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394467418] [2025-04-13 22:13:29,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394467418] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:29,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607848779] [2025-04-13 22:13:29,987 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:13:29,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:29,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:29,990 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:29,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 22:13:30,108 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:13:30,128 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 26 statements. [2025-04-13 22:13:30,128 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:13:30,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:30,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:13:30,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:30,355 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:13:30,355 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:13:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:30,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:30,548 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:30,548 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 192 treesize of output 192 [2025-04-13 22:13:30,954 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:30,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607848779] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:30,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:30,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 24 [2025-04-13 22:13:30,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442625758] [2025-04-13 22:13:30,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:30,955 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:13:30,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:30,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:13:30,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:13:30,956 INFO L87 Difference]: Start difference. First operand 146 states and 405 transitions. Second operand has 25 states, 24 states have (on average 2.125) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:31,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:31,799 INFO L93 Difference]: Finished difference Result 218 states and 565 transitions. [2025-04-13 22:13:31,799 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:13:31,800 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:13:31,800 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:31,801 INFO L225 Difference]: With dead ends: 218 [2025-04-13 22:13:31,801 INFO L226 Difference]: Without dead ends: 191 [2025-04-13 22:13:31,801 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=1497, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:13:31,801 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 136 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:31,801 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 0 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:13:31,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-04-13 22:13:31,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 144. [2025-04-13 22:13:31,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 2.769230769230769) internal successors, (396), 143 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:31,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 396 transitions. [2025-04-13 22:13:31,880 INFO L79 Accepts]: Start accepts. Automaton has 144 states and 396 transitions. Word has length 26 [2025-04-13 22:13:31,880 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:31,880 INFO L485 AbstractCegarLoop]: Abstraction has 144 states and 396 transitions. [2025-04-13 22:13:31,880 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:31,881 INFO L278 IsEmpty]: Start isEmpty. Operand 144 states and 396 transitions. [2025-04-13 22:13:31,881 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:31,881 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:31,881 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:31,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-13 22:13:32,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-13 22:13:32,082 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:32,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:32,082 INFO L85 PathProgramCache]: Analyzing trace with hash 656381983, now seen corresponding path program 19 times [2025-04-13 22:13:32,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:32,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707653348] [2025-04-13 22:13:32,082 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:13:32,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:32,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 22:13:32,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:32,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:32,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:32,536 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:13:32,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:32,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707653348] [2025-04-13 22:13:32,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707653348] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:32,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296534864] [2025-04-13 22:13:32,537 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:13:32,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:32,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:32,539 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:32,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 22:13:32,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 22:13:32,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:32,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:32,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:32,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 22:13:32,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:32,818 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:32,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:32,910 INFO L325 Elim1Store]: treesize reduction 11, result has 84.9 percent of original size [2025-04-13 22:13:32,910 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 74 [2025-04-13 22:13:32,935 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:32,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296534864] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:32,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:32,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 22 [2025-04-13 22:13:32,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549000987] [2025-04-13 22:13:32,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:32,936 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:13:32,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:32,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:13:32,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:13:32,936 INFO L87 Difference]: Start difference. First operand 144 states and 396 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:33,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:33,425 INFO L93 Difference]: Finished difference Result 202 states and 533 transitions. [2025-04-13 22:13:33,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:13:33,425 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 22:13:33,426 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:33,426 INFO L225 Difference]: With dead ends: 202 [2025-04-13 22:13:33,427 INFO L226 Difference]: Without dead ends: 195 [2025-04-13 22:13:33,427 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:13:33,427 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 87 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:33,427 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 0 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:33,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-04-13 22:13:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 142. [2025-04-13 22:13:33,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.765957446808511) internal successors, (390), 141 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 390 transitions. [2025-04-13 22:13:33,507 INFO L79 Accepts]: Start accepts. Automaton has 142 states and 390 transitions. Word has length 27 [2025-04-13 22:13:33,507 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:33,507 INFO L485 AbstractCegarLoop]: Abstraction has 142 states and 390 transitions. [2025-04-13 22:13:33,507 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:33,507 INFO L278 IsEmpty]: Start isEmpty. Operand 142 states and 390 transitions. [2025-04-13 22:13:33,507 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:33,507 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:33,507 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:33,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-13 22:13:33,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:33,708 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:33,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:33,708 INFO L85 PathProgramCache]: Analyzing trace with hash -495180467, now seen corresponding path program 20 times [2025-04-13 22:13:33,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:33,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232476107] [2025-04-13 22:13:33,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:33,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:33,718 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:33,729 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:33,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:33,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:34,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:34,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232476107] [2025-04-13 22:13:34,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232476107] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:34,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528153035] [2025-04-13 22:13:34,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:34,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:34,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:34,011 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:34,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 22:13:34,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:34,150 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:34,150 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:34,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:34,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 22:13:34,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:34,324 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:13:34,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:34,483 INFO L325 Elim1Store]: treesize reduction 22, result has 85.9 percent of original size [2025-04-13 22:13:34,483 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 150 [2025-04-13 22:13:34,588 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:34,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528153035] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:34,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:34,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 24 [2025-04-13 22:13:34,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836730130] [2025-04-13 22:13:34,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:34,589 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:13:34,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:34,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:13:34,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:13:34,590 INFO L87 Difference]: Start difference. First operand 142 states and 390 transitions. Second operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:35,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:35,081 INFO L93 Difference]: Finished difference Result 209 states and 540 transitions. [2025-04-13 22:13:35,081 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:13:35,081 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 22:13:35,081 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:35,082 INFO L225 Difference]: With dead ends: 209 [2025-04-13 22:13:35,082 INFO L226 Difference]: Without dead ends: 202 [2025-04-13 22:13:35,082 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:13:35,083 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:35,083 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:35,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-04-13 22:13:35,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 140. [2025-04-13 22:13:35,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.7553956834532376) internal successors, (383), 139 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:35,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 383 transitions. [2025-04-13 22:13:35,164 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 383 transitions. Word has length 27 [2025-04-13 22:13:35,164 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:35,164 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 383 transitions. [2025-04-13 22:13:35,164 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:35,164 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 383 transitions. [2025-04-13 22:13:35,164 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:35,165 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:35,165 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:35,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2025-04-13 22:13:35,365 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-13 22:13:35,365 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:35,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:35,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2081443123, now seen corresponding path program 21 times [2025-04-13 22:13:35,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:35,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335874796] [2025-04-13 22:13:35,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:35,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:35,374 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:35,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 27 statements. [2025-04-13 22:13:35,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:13:35,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:35,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:35,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335874796] [2025-04-13 22:13:35,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335874796] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:35,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679509829] [2025-04-13 22:13:35,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:35,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:35,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:35,626 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:35,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-13 22:13:35,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:35,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 27 statements. [2025-04-13 22:13:35,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:13:35,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:35,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:13:35,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:35,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:35,927 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:35,927 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 22:13:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:35,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679509829] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:35,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:35,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 23 [2025-04-13 22:13:35,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872815080] [2025-04-13 22:13:35,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:35,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:13:35,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:35,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:13:35,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:13:35,998 INFO L87 Difference]: Start difference. First operand 140 states and 383 transitions. Second operand has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:36,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:36,512 INFO L93 Difference]: Finished difference Result 224 states and 562 transitions. [2025-04-13 22:13:36,512 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:13:36,512 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 22:13:36,512 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:36,513 INFO L225 Difference]: With dead ends: 224 [2025-04-13 22:13:36,513 INFO L226 Difference]: Without dead ends: 217 [2025-04-13 22:13:36,514 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:13:36,514 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 111 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:36,514 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 0 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:36,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-04-13 22:13:36,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 144. [2025-04-13 22:13:36,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 2.7762237762237763) internal successors, (397), 143 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 397 transitions. [2025-04-13 22:13:36,602 INFO L79 Accepts]: Start accepts. Automaton has 144 states and 397 transitions. Word has length 27 [2025-04-13 22:13:36,602 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:36,602 INFO L485 AbstractCegarLoop]: Abstraction has 144 states and 397 transitions. [2025-04-13 22:13:36,602 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.130434782608696) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:36,602 INFO L278 IsEmpty]: Start isEmpty. Operand 144 states and 397 transitions. [2025-04-13 22:13:36,603 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:36,603 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:36,603 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:36,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-13 22:13:36,803 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-13 22:13:36,803 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:36,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:36,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2127636720, now seen corresponding path program 22 times [2025-04-13 22:13:36,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:36,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177275712] [2025-04-13 22:13:36,804 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:36,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:36,811 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:36,813 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 27 statements. [2025-04-13 22:13:36,814 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:13:36,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:36,902 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:36,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:36,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177275712] [2025-04-13 22:13:36,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177275712] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:36,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106295551] [2025-04-13 22:13:36,902 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:36,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:36,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:36,904 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:36,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-13 22:13:37,025 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:37,032 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 27 statements. [2025-04-13 22:13:37,032 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:13:37,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:37,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 22:13:37,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:37,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:37,132 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:37,132 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 22:13:37,182 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:37,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106295551] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:37,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:37,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 22:13:37,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97324456] [2025-04-13 22:13:37,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:37,183 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 22:13:37,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:37,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 22:13:37,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:13:37,183 INFO L87 Difference]: Start difference. First operand 144 states and 397 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:37,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:37,560 INFO L93 Difference]: Finished difference Result 225 states and 567 transitions. [2025-04-13 22:13:37,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:13:37,560 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 22:13:37,561 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:37,562 INFO L225 Difference]: With dead ends: 225 [2025-04-13 22:13:37,562 INFO L226 Difference]: Without dead ends: 214 [2025-04-13 22:13:37,562 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:13:37,562 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:37,562 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:13:37,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-04-13 22:13:37,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 140. [2025-04-13 22:13:37,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.726618705035971) internal successors, (379), 139 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 379 transitions. [2025-04-13 22:13:37,648 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 379 transitions. Word has length 27 [2025-04-13 22:13:37,648 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:37,648 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 379 transitions. [2025-04-13 22:13:37,648 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:37,648 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 379 transitions. [2025-04-13 22:13:37,648 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:37,648 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:37,648 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:37,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-04-13 22:13:37,848 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:37,849 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:37,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:37,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1002954017, now seen corresponding path program 23 times [2025-04-13 22:13:37,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:37,849 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358434561] [2025-04-13 22:13:37,849 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:37,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:37,858 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:37,885 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:37,885 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:37,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:38,203 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:13:38,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:38,204 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358434561] [2025-04-13 22:13:38,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358434561] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:38,204 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016684537] [2025-04-13 22:13:38,204 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:38,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:38,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:38,206 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:38,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-13 22:13:38,344 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:38,406 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:38,406 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:38,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:38,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:13:38,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:38,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:38,583 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:13:38,583 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 83 [2025-04-13 22:13:38,629 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:38,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016684537] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:38,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:38,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 20 [2025-04-13 22:13:38,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049473586] [2025-04-13 22:13:38,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:38,630 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:13:38,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:38,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:13:38,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:13:38,630 INFO L87 Difference]: Start difference. First operand 140 states and 379 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:39,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:39,020 INFO L93 Difference]: Finished difference Result 178 states and 471 transitions. [2025-04-13 22:13:39,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:13:39,021 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 22:13:39,021 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:39,022 INFO L225 Difference]: With dead ends: 178 [2025-04-13 22:13:39,022 INFO L226 Difference]: Without dead ends: 171 [2025-04-13 22:13:39,022 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:13:39,022 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:39,022 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:39,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-04-13 22:13:39,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 140. [2025-04-13 22:13:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.726618705035971) internal successors, (379), 139 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 379 transitions. [2025-04-13 22:13:39,106 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 379 transitions. Word has length 27 [2025-04-13 22:13:39,106 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:39,106 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 379 transitions. [2025-04-13 22:13:39,106 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:39,106 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 379 transitions. [2025-04-13 22:13:39,107 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:39,107 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:39,107 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:39,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-04-13 22:13:39,307 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:39,307 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:39,307 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:39,307 INFO L85 PathProgramCache]: Analyzing trace with hash -556383189, now seen corresponding path program 24 times [2025-04-13 22:13:39,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:39,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410202353] [2025-04-13 22:13:39,308 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:13:39,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:39,316 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:39,326 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 27 statements. [2025-04-13 22:13:39,327 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:13:39,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:39,552 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:39,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:39,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410202353] [2025-04-13 22:13:39,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410202353] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:39,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259815088] [2025-04-13 22:13:39,552 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:13:39,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:39,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:39,554 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:39,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-13 22:13:39,682 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:39,701 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 27 statements. [2025-04-13 22:13:39,701 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:13:39,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:39,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:13:39,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:39,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:39,853 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:13:39,853 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 87 [2025-04-13 22:13:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:39,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259815088] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:39,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:39,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 16 [2025-04-13 22:13:39,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671163390] [2025-04-13 22:13:39,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:39,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:13:39,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:39,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:13:39,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:13:39,896 INFO L87 Difference]: Start difference. First operand 140 states and 379 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:40,299 INFO L93 Difference]: Finished difference Result 175 states and 468 transitions. [2025-04-13 22:13:40,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:13:40,300 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 22:13:40,300 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:40,301 INFO L225 Difference]: With dead ends: 175 [2025-04-13 22:13:40,301 INFO L226 Difference]: Without dead ends: 168 [2025-04-13 22:13:40,301 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:13:40,301 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:40,301 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:40,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-04-13 22:13:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 137. [2025-04-13 22:13:40,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 2.713235294117647) internal successors, (369), 136 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:40,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 369 transitions. [2025-04-13 22:13:40,385 INFO L79 Accepts]: Start accepts. Automaton has 137 states and 369 transitions. Word has length 27 [2025-04-13 22:13:40,385 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:40,385 INFO L485 AbstractCegarLoop]: Abstraction has 137 states and 369 transitions. [2025-04-13 22:13:40,385 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:40,385 INFO L278 IsEmpty]: Start isEmpty. Operand 137 states and 369 transitions. [2025-04-13 22:13:40,386 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:40,386 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:40,386 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:40,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-13 22:13:40,586 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2025-04-13 22:13:40,586 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:40,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:40,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2106127854, now seen corresponding path program 25 times [2025-04-13 22:13:40,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:40,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154880134] [2025-04-13 22:13:40,587 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:13:40,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:40,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 22:13:40,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:40,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:40,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:41,004 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:13:41,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:41,004 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154880134] [2025-04-13 22:13:41,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154880134] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:41,004 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441125354] [2025-04-13 22:13:41,004 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:13:41,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:41,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:41,006 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:41,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-13 22:13:41,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 22:13:41,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:41,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:41,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:41,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 22:13:41,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:41,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:41,373 INFO L325 Elim1Store]: treesize reduction 22, result has 87.4 percent of original size [2025-04-13 22:13:41,373 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 70 treesize of output 171 [2025-04-13 22:13:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:41,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441125354] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:41,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:41,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 25 [2025-04-13 22:13:41,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857123727] [2025-04-13 22:13:41,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:41,597 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:13:41,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:41,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:13:41,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:13:41,597 INFO L87 Difference]: Start difference. First operand 137 states and 369 transitions. Second operand has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:42,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:42,330 INFO L93 Difference]: Finished difference Result 246 states and 592 transitions. [2025-04-13 22:13:42,330 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:13:42,331 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 22:13:42,331 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:42,332 INFO L225 Difference]: With dead ends: 246 [2025-04-13 22:13:42,332 INFO L226 Difference]: Without dead ends: 232 [2025-04-13 22:13:42,332 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=272, Invalid=1534, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:13:42,332 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:42,333 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:42,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-04-13 22:13:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 150. [2025-04-13 22:13:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.785234899328859) internal successors, (415), 149 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:42,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 415 transitions. [2025-04-13 22:13:42,433 INFO L79 Accepts]: Start accepts. Automaton has 150 states and 415 transitions. Word has length 27 [2025-04-13 22:13:42,433 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:42,433 INFO L485 AbstractCegarLoop]: Abstraction has 150 states and 415 transitions. [2025-04-13 22:13:42,433 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:42,433 INFO L278 IsEmpty]: Start isEmpty. Operand 150 states and 415 transitions. [2025-04-13 22:13:42,433 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:42,433 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:42,434 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:42,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 22:13:42,634 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:42,634 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:42,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:42,634 INFO L85 PathProgramCache]: Analyzing trace with hash -2139684292, now seen corresponding path program 26 times [2025-04-13 22:13:42,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:42,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162689869] [2025-04-13 22:13:42,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:42,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:42,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:42,653 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:42,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:42,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:42,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:42,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162689869] [2025-04-13 22:13:42,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162689869] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:42,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204922743] [2025-04-13 22:13:42,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:42,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:42,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:42,934 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:42,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-13 22:13:43,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:43,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:43,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:43,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:43,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 22:13:43,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:43,217 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:13:43,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:43,350 INFO L325 Elim1Store]: treesize reduction 22, result has 87.4 percent of original size [2025-04-13 22:13:43,350 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 70 treesize of output 171 [2025-04-13 22:13:43,507 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:43,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204922743] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:43,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:43,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 24 [2025-04-13 22:13:43,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173629044] [2025-04-13 22:13:43,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:43,507 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:13:43,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:43,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:13:43,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:13:43,508 INFO L87 Difference]: Start difference. First operand 150 states and 415 transitions. Second operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:44,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:44,298 INFO L93 Difference]: Finished difference Result 257 states and 620 transitions. [2025-04-13 22:13:44,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:13:44,298 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 22:13:44,298 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:44,299 INFO L225 Difference]: With dead ends: 257 [2025-04-13 22:13:44,299 INFO L226 Difference]: Without dead ends: 249 [2025-04-13 22:13:44,300 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=319, Invalid=1487, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:13:44,300 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 120 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:44,300 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 0 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:44,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-04-13 22:13:44,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 150. [2025-04-13 22:13:44,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.771812080536913) internal successors, (413), 149 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:44,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 413 transitions. [2025-04-13 22:13:44,405 INFO L79 Accepts]: Start accepts. Automaton has 150 states and 413 transitions. Word has length 27 [2025-04-13 22:13:44,405 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:44,405 INFO L485 AbstractCegarLoop]: Abstraction has 150 states and 413 transitions. [2025-04-13 22:13:44,405 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:44,406 INFO L278 IsEmpty]: Start isEmpty. Operand 150 states and 413 transitions. [2025-04-13 22:13:44,406 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:44,406 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:44,406 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:44,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2025-04-13 22:13:44,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-04-13 22:13:44,606 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:44,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:44,607 INFO L85 PathProgramCache]: Analyzing trace with hash -887413424, now seen corresponding path program 27 times [2025-04-13 22:13:44,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:44,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422781619] [2025-04-13 22:13:44,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:44,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:44,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:44,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 27 statements. [2025-04-13 22:13:44,624 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:13:44,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:44,854 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:44,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:44,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422781619] [2025-04-13 22:13:44,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422781619] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:44,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761807527] [2025-04-13 22:13:44,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:44,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:44,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:44,857 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:44,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-13 22:13:44,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:45,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 27 statements. [2025-04-13 22:13:45,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:13:45,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:45,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:13:45,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:45,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:45,287 INFO L325 Elim1Store]: treesize reduction 22, result has 85.9 percent of original size [2025-04-13 22:13:45,287 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 150 [2025-04-13 22:13:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:45,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761807527] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:45,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:45,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 19 [2025-04-13 22:13:45,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393785348] [2025-04-13 22:13:45,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:45,381 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:13:45,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:45,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:13:45,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:13:45,382 INFO L87 Difference]: Start difference. First operand 150 states and 413 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:45,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:45,975 INFO L93 Difference]: Finished difference Result 246 states and 627 transitions. [2025-04-13 22:13:45,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:13:45,976 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 22:13:45,976 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:45,977 INFO L225 Difference]: With dead ends: 246 [2025-04-13 22:13:45,977 INFO L226 Difference]: Without dead ends: 235 [2025-04-13 22:13:45,977 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:13:45,977 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:45,977 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:45,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-04-13 22:13:46,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 154. [2025-04-13 22:13:46,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.803921568627451) internal successors, (429), 153 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 429 transitions. [2025-04-13 22:13:46,083 INFO L79 Accepts]: Start accepts. Automaton has 154 states and 429 transitions. Word has length 27 [2025-04-13 22:13:46,083 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:46,083 INFO L485 AbstractCegarLoop]: Abstraction has 154 states and 429 transitions. [2025-04-13 22:13:46,083 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:46,083 INFO L278 IsEmpty]: Start isEmpty. Operand 154 states and 429 transitions. [2025-04-13 22:13:46,084 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:46,084 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:46,084 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:46,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2025-04-13 22:13:46,284 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:46,284 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:46,284 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:46,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1689210166, now seen corresponding path program 28 times [2025-04-13 22:13:46,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:46,285 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824623464] [2025-04-13 22:13:46,285 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:46,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:46,292 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:46,295 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 27 statements. [2025-04-13 22:13:46,295 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:13:46,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:46,393 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:46,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:46,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824623464] [2025-04-13 22:13:46,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824623464] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:46,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946703353] [2025-04-13 22:13:46,393 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:46,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:46,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:46,395 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:46,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-04-13 22:13:46,534 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:46,541 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 27 statements. [2025-04-13 22:13:46,542 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:13:46,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:46,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 22:13:46,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:46,582 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:46,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:46,663 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:13:46,663 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 87 [2025-04-13 22:13:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:46,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946703353] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:46,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:46,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 22:13:46,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818881005] [2025-04-13 22:13:46,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:46,700 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 22:13:46,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:46,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 22:13:46,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:13:46,700 INFO L87 Difference]: Start difference. First operand 154 states and 429 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:47,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:47,034 INFO L93 Difference]: Finished difference Result 203 states and 536 transitions. [2025-04-13 22:13:47,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:13:47,034 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 22:13:47,035 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:47,036 INFO L225 Difference]: With dead ends: 203 [2025-04-13 22:13:47,036 INFO L226 Difference]: Without dead ends: 192 [2025-04-13 22:13:47,036 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:13:47,036 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:47,036 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:13:47,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-04-13 22:13:47,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 150. [2025-04-13 22:13:47,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.771812080536913) internal successors, (413), 149 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:47,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 413 transitions. [2025-04-13 22:13:47,136 INFO L79 Accepts]: Start accepts. Automaton has 150 states and 413 transitions. Word has length 27 [2025-04-13 22:13:47,136 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:47,136 INFO L485 AbstractCegarLoop]: Abstraction has 150 states and 413 transitions. [2025-04-13 22:13:47,136 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:47,136 INFO L278 IsEmpty]: Start isEmpty. Operand 150 states and 413 transitions. [2025-04-13 22:13:47,137 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:13:47,137 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:47,137 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:47,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-04-13 22:13:47,337 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-04-13 22:13:47,337 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:47,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:47,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1127028735, now seen corresponding path program 29 times [2025-04-13 22:13:47,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:47,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444776440] [2025-04-13 22:13:47,338 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:47,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:47,347 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:13:47,360 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:13:47,360 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:47,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:47,815 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:13:47,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:47,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444776440] [2025-04-13 22:13:47,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444776440] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:47,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660709433] [2025-04-13 22:13:47,816 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:47,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:47,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:47,817 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:47,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-04-13 22:13:47,963 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:13:48,010 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:13:48,010 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:48,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:48,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:13:48,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:48,224 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:13:48,224 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 22:13:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:48,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:48,471 INFO L325 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2025-04-13 22:13:48,472 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 180 treesize of output 165 [2025-04-13 22:13:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:48,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660709433] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:48,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:48,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 28 [2025-04-13 22:13:48,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269870090] [2025-04-13 22:13:48,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:48,606 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:13:48,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:48,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:13:48,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:13:48,607 INFO L87 Difference]: Start difference. First operand 150 states and 413 transitions. Second operand has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 29 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:49,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:49,736 INFO L93 Difference]: Finished difference Result 231 states and 601 transitions. [2025-04-13 22:13:49,736 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:13:49,736 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 29 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:13:49,736 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:49,737 INFO L225 Difference]: With dead ends: 231 [2025-04-13 22:13:49,737 INFO L226 Difference]: Without dead ends: 205 [2025-04-13 22:13:49,737 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=380, Invalid=2590, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:13:49,738 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 195 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:49,738 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 0 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:13:49,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-04-13 22:13:49,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 154. [2025-04-13 22:13:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.758169934640523) internal successors, (422), 153 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 422 transitions. [2025-04-13 22:13:49,841 INFO L79 Accepts]: Start accepts. Automaton has 154 states and 422 transitions. Word has length 28 [2025-04-13 22:13:49,841 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:49,841 INFO L485 AbstractCegarLoop]: Abstraction has 154 states and 422 transitions. [2025-04-13 22:13:49,841 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.107142857142857) internal successors, (59), 29 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:49,841 INFO L278 IsEmpty]: Start isEmpty. Operand 154 states and 422 transitions. [2025-04-13 22:13:49,841 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:13:49,841 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:49,841 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:49,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-04-13 22:13:50,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-04-13 22:13:50,042 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:50,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:50,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1322121025, now seen corresponding path program 30 times [2025-04-13 22:13:50,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:50,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715126508] [2025-04-13 22:13:50,042 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:13:50,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:50,050 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:13:50,060 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 22:13:50,060 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:13:50,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:50,443 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:50,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:50,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715126508] [2025-04-13 22:13:50,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715126508] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:50,444 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184971877] [2025-04-13 22:13:50,444 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:13:50,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:50,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:50,446 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:50,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-04-13 22:13:50,595 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:13:50,614 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 22:13:50,614 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:13:50,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:50,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:13:50,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:50,897 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:13:50,897 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:13:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:50,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:51,244 INFO L325 Elim1Store]: treesize reduction 11, result has 93.9 percent of original size [2025-04-13 22:13:51,244 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 236 treesize of output 302 [2025-04-13 22:13:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:52,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184971877] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:52,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:52,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 30 [2025-04-13 22:13:52,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336706698] [2025-04-13 22:13:52,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:52,067 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:13:52,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:52,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:13:52,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:13:52,068 INFO L87 Difference]: Start difference. First operand 154 states and 422 transitions. Second operand has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:53,343 INFO L93 Difference]: Finished difference Result 253 states and 637 transitions. [2025-04-13 22:13:53,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:13:53,343 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:13:53,343 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:53,344 INFO L225 Difference]: With dead ends: 253 [2025-04-13 22:13:53,344 INFO L226 Difference]: Without dead ends: 228 [2025-04-13 22:13:53,345 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=379, Invalid=2701, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 22:13:53,345 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 174 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:53,345 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 0 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:13:53,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-04-13 22:13:53,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 164. [2025-04-13 22:13:53,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 2.7423312883435584) internal successors, (447), 163 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:53,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 447 transitions. [2025-04-13 22:13:53,468 INFO L79 Accepts]: Start accepts. Automaton has 164 states and 447 transitions. Word has length 28 [2025-04-13 22:13:53,468 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:53,468 INFO L485 AbstractCegarLoop]: Abstraction has 164 states and 447 transitions. [2025-04-13 22:13:53,469 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:53,469 INFO L278 IsEmpty]: Start isEmpty. Operand 164 states and 447 transitions. [2025-04-13 22:13:53,469 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:13:53,469 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:53,469 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:53,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2025-04-13 22:13:53,669 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-04-13 22:13:53,670 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:53,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:53,670 INFO L85 PathProgramCache]: Analyzing trace with hash 201688625, now seen corresponding path program 31 times [2025-04-13 22:13:53,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:53,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679103801] [2025-04-13 22:13:53,670 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:13:53,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:53,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:13:53,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:13:53,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:53,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:13:54,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:54,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679103801] [2025-04-13 22:13:54,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679103801] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:54,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55144872] [2025-04-13 22:13:54,251 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:13:54,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:54,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:54,254 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:54,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-04-13 22:13:54,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:13:54,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:13:54,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:54,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:54,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 22:13:54,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:54,620 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:13:54,620 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:13:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:54,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:54,843 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:54,843 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 212 [2025-04-13 22:13:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:55,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55144872] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:55,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:55,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 33 [2025-04-13 22:13:55,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2724969] [2025-04-13 22:13:55,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:55,548 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:13:55,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:55,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:13:55,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:13:55,548 INFO L87 Difference]: Start difference. First operand 164 states and 447 transitions. Second operand has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:57,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:57,341 INFO L93 Difference]: Finished difference Result 292 states and 740 transitions. [2025-04-13 22:13:57,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 22:13:57,341 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:13:57,341 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:57,342 INFO L225 Difference]: With dead ends: 292 [2025-04-13 22:13:57,342 INFO L226 Difference]: Without dead ends: 251 [2025-04-13 22:13:57,343 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=552, Invalid=4418, Unknown=0, NotChecked=0, Total=4970 [2025-04-13 22:13:57,343 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 214 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:57,343 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 0 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:13:57,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-04-13 22:13:57,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 164. [2025-04-13 22:13:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 2.7791411042944785) internal successors, (453), 163 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:57,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 453 transitions. [2025-04-13 22:13:57,462 INFO L79 Accepts]: Start accepts. Automaton has 164 states and 453 transitions. Word has length 28 [2025-04-13 22:13:57,462 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:57,462 INFO L485 AbstractCegarLoop]: Abstraction has 164 states and 453 transitions. [2025-04-13 22:13:57,462 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:13:57,463 INFO L278 IsEmpty]: Start isEmpty. Operand 164 states and 453 transitions. [2025-04-13 22:13:57,463 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:13:57,463 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:57,463 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:57,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2025-04-13 22:13:57,663 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-04-13 22:13:57,663 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:13:57,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:57,664 INFO L85 PathProgramCache]: Analyzing trace with hash 250843775, now seen corresponding path program 32 times [2025-04-13 22:13:57,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:57,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303042789] [2025-04-13 22:13:57,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:57,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:57,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:13:57,682 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:13:57,682 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:57,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:58,049 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:58,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:58,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303042789] [2025-04-13 22:13:58,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303042789] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:58,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522713097] [2025-04-13 22:13:58,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:58,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:58,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:58,051 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:13:58,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-04-13 22:13:58,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:13:58,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:13:58,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:58,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:58,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 22:13:58,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:58,422 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:13:58,422 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:13:58,441 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:13:58,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:58,782 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-13 22:13:58,782 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 191 treesize of output 233 [2025-04-13 22:14:00,507 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:00,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522713097] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:00,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:00,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 25 [2025-04-13 22:14:00,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720024591] [2025-04-13 22:14:00,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:00,508 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:14:00,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:00,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:14:00,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:14:00,509 INFO L87 Difference]: Start difference. First operand 164 states and 453 transitions. Second operand has 26 states, 25 states have (on average 1.92) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:03,712 INFO L93 Difference]: Finished difference Result 443 states and 1040 transitions. [2025-04-13 22:14:03,712 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-13 22:14:03,712 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.92) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:14:03,712 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:03,713 INFO L225 Difference]: With dead ends: 443 [2025-04-13 22:14:03,713 INFO L226 Difference]: Without dead ends: 412 [2025-04-13 22:14:03,714 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2105 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=835, Invalid=5971, Unknown=0, NotChecked=0, Total=6806 [2025-04-13 22:14:03,714 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 302 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:03,714 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 0 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:14:03,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-04-13 22:14:03,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 182. [2025-04-13 22:14:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 2.883977900552486) internal successors, (522), 181 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 522 transitions. [2025-04-13 22:14:03,856 INFO L79 Accepts]: Start accepts. Automaton has 182 states and 522 transitions. Word has length 28 [2025-04-13 22:14:03,856 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:03,856 INFO L485 AbstractCegarLoop]: Abstraction has 182 states and 522 transitions. [2025-04-13 22:14:03,856 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.92) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:03,857 INFO L278 IsEmpty]: Start isEmpty. Operand 182 states and 522 transitions. [2025-04-13 22:14:03,857 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:03,857 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:03,857 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:03,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2025-04-13 22:14:04,057 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:04,058 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:14:04,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:04,058 INFO L85 PathProgramCache]: Analyzing trace with hash 253351985, now seen corresponding path program 33 times [2025-04-13 22:14:04,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:04,058 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588372219] [2025-04-13 22:14:04,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:14:04,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:04,068 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:04,077 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-13 22:14:04,077 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:14:04,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:04,439 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:04,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:04,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588372219] [2025-04-13 22:14:04,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588372219] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:04,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817292004] [2025-04-13 22:14:04,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:14:04,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:04,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:04,441 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:14:04,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-04-13 22:14:04,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:04,613 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-13 22:14:04,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:14:04,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:04,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:14:04,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:04,763 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:14:04,763 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:14:04,786 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:04,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:04,906 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:04,906 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 22:14:05,510 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:05,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817292004] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:05,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:05,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 24 [2025-04-13 22:14:05,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684964092] [2025-04-13 22:14:05,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:05,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:14:05,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:05,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:14:05,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:14:05,511 INFO L87 Difference]: Start difference. First operand 182 states and 522 transitions. Second operand has 25 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:06,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:06,850 INFO L93 Difference]: Finished difference Result 355 states and 874 transitions. [2025-04-13 22:14:06,850 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 22:14:06,850 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:14:06,851 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:06,852 INFO L225 Difference]: With dead ends: 355 [2025-04-13 22:14:06,852 INFO L226 Difference]: Without dead ends: 322 [2025-04-13 22:14:06,852 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=343, Invalid=2849, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:14:06,853 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 199 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:06,853 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 0 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:14:06,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-04-13 22:14:07,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 182. [2025-04-13 22:14:07,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 2.850828729281768) internal successors, (516), 181 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:07,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 516 transitions. [2025-04-13 22:14:07,002 INFO L79 Accepts]: Start accepts. Automaton has 182 states and 516 transitions. Word has length 28 [2025-04-13 22:14:07,002 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:07,002 INFO L485 AbstractCegarLoop]: Abstraction has 182 states and 516 transitions. [2025-04-13 22:14:07,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:07,003 INFO L278 IsEmpty]: Start isEmpty. Operand 182 states and 516 transitions. [2025-04-13 22:14:07,003 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:07,003 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:07,003 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:07,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2025-04-13 22:14:07,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:07,203 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:14:07,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:07,204 INFO L85 PathProgramCache]: Analyzing trace with hash 227676819, now seen corresponding path program 34 times [2025-04-13 22:14:07,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:07,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213437203] [2025-04-13 22:14:07,204 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:14:07,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:07,212 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:07,216 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 22:14:07,216 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:14:07,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:07,410 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:07,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:07,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213437203] [2025-04-13 22:14:07,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213437203] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:07,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477663646] [2025-04-13 22:14:07,410 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:14:07,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:07,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:07,412 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:14:07,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-04-13 22:14:07,566 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:07,574 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 22:14:07,574 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:14:07,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:07,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 22:14:07,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:07,718 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:14:07,719 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:14:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:07,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:07,926 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:07,926 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 197 [2025-04-13 22:14:08,389 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:08,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477663646] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:08,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:08,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-04-13 22:14:08,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923869441] [2025-04-13 22:14:08,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:08,389 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:14:08,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:08,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:14:08,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:14:08,390 INFO L87 Difference]: Start difference. First operand 182 states and 516 transitions. Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:09,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:09,353 INFO L93 Difference]: Finished difference Result 246 states and 663 transitions. [2025-04-13 22:14:09,353 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:14:09,353 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:14:09,353 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:09,354 INFO L225 Difference]: With dead ends: 246 [2025-04-13 22:14:09,354 INFO L226 Difference]: Without dead ends: 221 [2025-04-13 22:14:09,355 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=1173, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:14:09,355 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:09,355 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:14:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-04-13 22:14:09,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 189. [2025-04-13 22:14:09,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 2.824468085106383) internal successors, (531), 188 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:09,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 531 transitions. [2025-04-13 22:14:09,520 INFO L79 Accepts]: Start accepts. Automaton has 189 states and 531 transitions. Word has length 28 [2025-04-13 22:14:09,520 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:09,520 INFO L485 AbstractCegarLoop]: Abstraction has 189 states and 531 transitions. [2025-04-13 22:14:09,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:09,520 INFO L278 IsEmpty]: Start isEmpty. Operand 189 states and 531 transitions. [2025-04-13 22:14:09,520 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:09,520 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:09,520 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:09,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2025-04-13 22:14:09,721 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2025-04-13 22:14:09,721 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:14:09,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:09,721 INFO L85 PathProgramCache]: Analyzing trace with hash 22439135, now seen corresponding path program 35 times [2025-04-13 22:14:09,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:09,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985275048] [2025-04-13 22:14:09,721 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:14:09,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:09,730 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:09,743 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:09,743 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:14:09,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:10,218 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:14:10,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:10,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985275048] [2025-04-13 22:14:10,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985275048] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:10,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522485958] [2025-04-13 22:14:10,218 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:14:10,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:10,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:10,220 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:14:10,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-04-13 22:14:10,382 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:10,432 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:10,432 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:14:10,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:10,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:14:10,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:10,617 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:14:10,617 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 22:14:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:10,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:10,789 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:10,789 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 197 [2025-04-13 22:14:11,242 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:11,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522485958] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:11,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:11,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 30 [2025-04-13 22:14:11,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588038641] [2025-04-13 22:14:11,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:11,243 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:14:11,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:11,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:14:11,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:14:11,244 INFO L87 Difference]: Start difference. First operand 189 states and 531 transitions. Second operand has 31 states, 30 states have (on average 2.033333333333333) internal successors, (61), 31 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:12,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:12,580 INFO L93 Difference]: Finished difference Result 258 states and 688 transitions. [2025-04-13 22:14:12,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:14:12,580 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.033333333333333) internal successors, (61), 31 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:14:12,580 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:12,581 INFO L225 Difference]: With dead ends: 258 [2025-04-13 22:14:12,581 INFO L226 Difference]: Without dead ends: 234 [2025-04-13 22:14:12,582 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=383, Invalid=2923, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 22:14:12,582 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 175 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:12,582 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 0 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:14:12,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-04-13 22:14:12,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 191. [2025-04-13 22:14:12,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 2.8210526315789473) internal successors, (536), 190 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:12,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 536 transitions. [2025-04-13 22:14:12,747 INFO L79 Accepts]: Start accepts. Automaton has 191 states and 536 transitions. Word has length 28 [2025-04-13 22:14:12,747 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:12,747 INFO L485 AbstractCegarLoop]: Abstraction has 191 states and 536 transitions. [2025-04-13 22:14:12,747 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.033333333333333) internal successors, (61), 31 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:12,748 INFO L278 IsEmpty]: Start isEmpty. Operand 191 states and 536 transitions. [2025-04-13 22:14:12,748 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:12,748 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:12,748 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:12,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2025-04-13 22:14:12,948 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:12,948 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:14:12,949 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:12,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1646749421, now seen corresponding path program 36 times [2025-04-13 22:14:12,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:12,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245746370] [2025-04-13 22:14:12,949 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:14:12,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:12,957 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:12,973 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:12,973 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:14:12,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:13,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:13,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245746370] [2025-04-13 22:14:13,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245746370] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:13,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513809316] [2025-04-13 22:14:13,334 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:14:13,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:13,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:13,336 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:14:13,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-04-13 22:14:13,514 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:13,542 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:13,543 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:14:13,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:13,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 22:14:13,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:13,721 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:14:13,721 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:14:13,740 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:13,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:14,126 INFO L325 Elim1Store]: treesize reduction 11, result has 93.9 percent of original size [2025-04-13 22:14:14,126 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 195 treesize of output 239 [2025-04-13 22:14:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:15,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513809316] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:15,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:15,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 24 [2025-04-13 22:14:15,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887403360] [2025-04-13 22:14:15,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:15,904 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:14:15,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:15,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:14:15,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:14:15,904 INFO L87 Difference]: Start difference. First operand 191 states and 536 transitions. Second operand has 25 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:18,732 INFO L93 Difference]: Finished difference Result 383 states and 964 transitions. [2025-04-13 22:14:18,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-13 22:14:18,732 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:14:18,732 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:18,734 INFO L225 Difference]: With dead ends: 383 [2025-04-13 22:14:18,734 INFO L226 Difference]: Without dead ends: 357 [2025-04-13 22:14:18,734 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1294 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=619, Invalid=3937, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 22:14:18,734 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 241 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:18,735 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 0 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:14:18,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-04-13 22:14:18,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 213. [2025-04-13 22:14:18,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 2.919811320754717) internal successors, (619), 212 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:18,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 619 transitions. [2025-04-13 22:14:18,934 INFO L79 Accepts]: Start accepts. Automaton has 213 states and 619 transitions. Word has length 28 [2025-04-13 22:14:18,934 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:18,934 INFO L485 AbstractCegarLoop]: Abstraction has 213 states and 619 transitions. [2025-04-13 22:14:18,934 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:18,934 INFO L278 IsEmpty]: Start isEmpty. Operand 213 states and 619 transitions. [2025-04-13 22:14:18,934 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:18,934 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:18,934 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:18,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2025-04-13 22:14:19,135 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2025-04-13 22:14:19,135 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:14:19,135 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:19,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1644241211, now seen corresponding path program 37 times [2025-04-13 22:14:19,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:19,135 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995289421] [2025-04-13 22:14:19,135 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:14:19,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:19,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:14:19,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:19,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:19,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:19,677 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:14:19,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:19,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995289421] [2025-04-13 22:14:19,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995289421] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:19,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85742840] [2025-04-13 22:14:19,677 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:14:19,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:19,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:19,679 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:14:19,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2025-04-13 22:14:19,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:14:19,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:19,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:19,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:19,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 22:14:19,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:20,032 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:14:20,033 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:14:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:20,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:20,180 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:20,180 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 226 treesize of output 222 [2025-04-13 22:14:20,636 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:20,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85742840] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:20,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:20,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 33 [2025-04-13 22:14:20,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666228226] [2025-04-13 22:14:20,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:20,636 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:14:20,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:20,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:14:20,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1005, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:14:20,637 INFO L87 Difference]: Start difference. First operand 213 states and 619 transitions. Second operand has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:22,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:22,897 INFO L93 Difference]: Finished difference Result 399 states and 990 transitions. [2025-04-13 22:14:22,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-13 22:14:22,898 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:14:22,898 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:22,899 INFO L225 Difference]: With dead ends: 399 [2025-04-13 22:14:22,899 INFO L226 Difference]: Without dead ends: 358 [2025-04-13 22:14:22,900 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2205 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=840, Invalid=7170, Unknown=0, NotChecked=0, Total=8010 [2025-04-13 22:14:22,900 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 271 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:22,901 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 0 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:14:22,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-04-13 22:14:23,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 219. [2025-04-13 22:14:23,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 2.9174311926605503) internal successors, (636), 218 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:23,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 636 transitions. [2025-04-13 22:14:23,136 INFO L79 Accepts]: Start accepts. Automaton has 219 states and 636 transitions. Word has length 28 [2025-04-13 22:14:23,136 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:23,136 INFO L485 AbstractCegarLoop]: Abstraction has 219 states and 636 transitions. [2025-04-13 22:14:23,136 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:23,136 INFO L278 IsEmpty]: Start isEmpty. Operand 219 states and 636 transitions. [2025-04-13 22:14:23,137 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:23,137 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:23,137 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:23,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2025-04-13 22:14:23,337 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:23,337 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:14:23,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:23,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1533418691, now seen corresponding path program 38 times [2025-04-13 22:14:23,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:23,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931771709] [2025-04-13 22:14:23,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:14:23,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:23,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:23,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:23,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:14:23,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:23,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:23,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931771709] [2025-04-13 22:14:23,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931771709] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:23,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094991557] [2025-04-13 22:14:23,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:14:23,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:23,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:23,754 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:14:23,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2025-04-13 22:14:23,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:23,943 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:23,944 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:14:23,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:23,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 22:14:23,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:24,235 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:14:24,235 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:14:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:14:24,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:24,656 INFO L325 Elim1Store]: treesize reduction 11, result has 93.9 percent of original size [2025-04-13 22:14:24,656 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 209 treesize of output 253 [2025-04-13 22:14:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:27,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094991557] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:27,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:27,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 32 [2025-04-13 22:14:27,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218598217] [2025-04-13 22:14:27,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:27,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:14:27,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:27,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:14:27,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=952, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:14:27,372 INFO L87 Difference]: Start difference. First operand 219 states and 636 transitions. Second operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:29,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:29,423 INFO L93 Difference]: Finished difference Result 327 states and 861 transitions. [2025-04-13 22:14:29,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 22:14:29,423 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:14:29,424 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:29,425 INFO L225 Difference]: With dead ends: 327 [2025-04-13 22:14:29,425 INFO L226 Difference]: Without dead ends: 298 [2025-04-13 22:14:29,425 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=476, Invalid=3814, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 22:14:29,426 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 188 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:29,426 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 0 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:14:29,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-04-13 22:14:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 223. [2025-04-13 22:14:29,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 2.918918918918919) internal successors, (648), 222 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 648 transitions. [2025-04-13 22:14:29,646 INFO L79 Accepts]: Start accepts. Automaton has 223 states and 648 transitions. Word has length 28 [2025-04-13 22:14:29,646 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:29,646 INFO L485 AbstractCegarLoop]: Abstraction has 223 states and 648 transitions. [2025-04-13 22:14:29,646 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:29,646 INFO L278 IsEmpty]: Start isEmpty. Operand 223 states and 648 transitions. [2025-04-13 22:14:29,646 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:29,646 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:29,646 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:29,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2025-04-13 22:14:29,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:29,848 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:14:29,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:29,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1026769727, now seen corresponding path program 39 times [2025-04-13 22:14:29,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:29,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949414860] [2025-04-13 22:14:29,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:14:29,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:29,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:29,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-13 22:14:29,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:14:29,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:30,229 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:30,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:30,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949414860] [2025-04-13 22:14:30,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949414860] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:30,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428878067] [2025-04-13 22:14:30,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:14:30,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:30,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:30,231 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:14:30,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2025-04-13 22:14:30,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:30,425 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-13 22:14:30,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:14:30,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:30,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:14:30,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:30,784 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:14:30,784 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:14:30,810 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:30,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:31,366 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-13 22:14:31,366 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 254 treesize of output 292 [2025-04-13 22:14:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:35,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428878067] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:35,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:35,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 30 [2025-04-13 22:14:35,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517382349] [2025-04-13 22:14:35,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:35,155 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:14:35,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:35,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:14:35,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:14:35,156 INFO L87 Difference]: Start difference. First operand 223 states and 648 transitions. Second operand has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:37,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:37,157 INFO L93 Difference]: Finished difference Result 312 states and 828 transitions. [2025-04-13 22:14:37,157 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 22:14:37,157 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:14:37,157 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:37,159 INFO L225 Difference]: With dead ends: 312 [2025-04-13 22:14:37,159 INFO L226 Difference]: Without dead ends: 281 [2025-04-13 22:14:37,159 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=497, Invalid=3285, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 22:14:37,159 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 187 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:37,160 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 0 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:14:37,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-04-13 22:14:37,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 233. [2025-04-13 22:14:37,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 2.9008620689655173) internal successors, (673), 232 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:37,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 673 transitions. [2025-04-13 22:14:37,418 INFO L79 Accepts]: Start accepts. Automaton has 233 states and 673 transitions. Word has length 28 [2025-04-13 22:14:37,418 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:37,418 INFO L485 AbstractCegarLoop]: Abstraction has 233 states and 673 transitions. [2025-04-13 22:14:37,418 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:37,419 INFO L278 IsEmpty]: Start isEmpty. Operand 233 states and 673 transitions. [2025-04-13 22:14:37,419 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:37,419 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:37,419 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:37,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2025-04-13 22:14:37,619 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2025-04-13 22:14:37,619 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:14:37,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:37,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1744387919, now seen corresponding path program 40 times [2025-04-13 22:14:37,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:37,620 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033441610] [2025-04-13 22:14:37,620 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:14:37,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:37,629 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:37,632 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 22:14:37,632 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:14:37,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:37,824 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:37,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:37,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033441610] [2025-04-13 22:14:37,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033441610] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:37,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292369890] [2025-04-13 22:14:37,824 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:14:37,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:37,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:37,826 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:14:37,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2025-04-13 22:14:38,017 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:38,026 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 22:14:38,026 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:14:38,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:38,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 22:14:38,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:38,154 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:14:38,154 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:14:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:38,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:38,316 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:38,316 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 197 [2025-04-13 22:14:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:38,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292369890] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:38,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:38,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-04-13 22:14:38,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560009247] [2025-04-13 22:14:38,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:38,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:14:38,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:38,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:14:38,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:14:38,859 INFO L87 Difference]: Start difference. First operand 233 states and 673 transitions. Second operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:40,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:40,169 INFO L93 Difference]: Finished difference Result 345 states and 918 transitions. [2025-04-13 22:14:40,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:14:40,169 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:14:40,169 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:40,170 INFO L225 Difference]: With dead ends: 345 [2025-04-13 22:14:40,171 INFO L226 Difference]: Without dead ends: 323 [2025-04-13 22:14:40,171 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=254, Invalid=1726, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:14:40,171 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:40,171 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:14:40,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-04-13 22:14:40,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 245. [2025-04-13 22:14:40,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 2.94672131147541) internal successors, (719), 244 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:40,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 719 transitions. [2025-04-13 22:14:40,433 INFO L79 Accepts]: Start accepts. Automaton has 245 states and 719 transitions. Word has length 28 [2025-04-13 22:14:40,433 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:40,433 INFO L485 AbstractCegarLoop]: Abstraction has 245 states and 719 transitions. [2025-04-13 22:14:40,433 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:40,433 INFO L278 IsEmpty]: Start isEmpty. Operand 245 states and 719 transitions. [2025-04-13 22:14:40,433 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:40,433 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:40,433 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:40,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2025-04-13 22:14:40,634 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-04-13 22:14:40,634 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:14:40,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:40,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1239327759, now seen corresponding path program 41 times [2025-04-13 22:14:40,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:40,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79607701] [2025-04-13 22:14:40,634 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:14:40,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:40,643 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:40,656 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:40,656 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:14:40,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:41,071 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:14:41,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:41,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79607701] [2025-04-13 22:14:41,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79607701] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:41,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145947554] [2025-04-13 22:14:41,071 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:14:41,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:41,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:41,073 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:14:41,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2025-04-13 22:14:41,255 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:41,344 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:41,345 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:14:41,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:41,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:14:41,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:41,593 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:14:41,593 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 22:14:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:14:41,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:41,777 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:41,777 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 197 [2025-04-13 22:14:42,306 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:42,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145947554] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:42,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:42,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 30 [2025-04-13 22:14:42,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613728313] [2025-04-13 22:14:42,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:42,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:14:42,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:42,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:14:42,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:14:42,307 INFO L87 Difference]: Start difference. First operand 245 states and 719 transitions. Second operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 31 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:43,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:43,846 INFO L93 Difference]: Finished difference Result 321 states and 881 transitions. [2025-04-13 22:14:43,846 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 22:14:43,846 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.8) internal successors, (54), 31 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:14:43,846 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:43,848 INFO L225 Difference]: With dead ends: 321 [2025-04-13 22:14:43,848 INFO L226 Difference]: Without dead ends: 292 [2025-04-13 22:14:43,848 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=397, Invalid=3509, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 22:14:43,848 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 162 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:43,848 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 0 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:14:43,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-04-13 22:14:44,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 247. [2025-04-13 22:14:44,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 2.9430894308943087) internal successors, (724), 246 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:44,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 724 transitions. [2025-04-13 22:14:44,113 INFO L79 Accepts]: Start accepts. Automaton has 247 states and 724 transitions. Word has length 28 [2025-04-13 22:14:44,113 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:44,113 INFO L485 AbstractCegarLoop]: Abstraction has 247 states and 724 transitions. [2025-04-13 22:14:44,113 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.8) internal successors, (54), 31 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:44,113 INFO L278 IsEmpty]: Start isEmpty. Operand 247 states and 724 transitions. [2025-04-13 22:14:44,114 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:44,114 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:44,114 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:44,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2025-04-13 22:14:44,314 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2025-04-13 22:14:44,314 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:14:44,315 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:44,315 INFO L85 PathProgramCache]: Analyzing trace with hash -342596353, now seen corresponding path program 42 times [2025-04-13 22:14:44,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:44,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574061870] [2025-04-13 22:14:44,315 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:14:44,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:44,323 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:44,349 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:44,349 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:14:44,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:44,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:44,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574061870] [2025-04-13 22:14:44,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574061870] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:44,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004131950] [2025-04-13 22:14:44,697 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:14:44,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:44,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:44,699 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:14:44,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2025-04-13 22:14:44,877 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:44,904 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:44,905 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:14:44,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:44,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:14:44,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:45,203 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:14:45,204 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:14:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:45,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:45,747 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-13 22:14:45,747 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 209 treesize of output 247 [2025-04-13 22:14:47,258 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:47,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004131950] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:47,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:47,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 30 [2025-04-13 22:14:47,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123748164] [2025-04-13 22:14:47,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:47,259 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:14:47,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:47,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:14:47,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:14:47,259 INFO L87 Difference]: Start difference. First operand 247 states and 724 transitions. Second operand has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:50,858 INFO L93 Difference]: Finished difference Result 408 states and 1103 transitions. [2025-04-13 22:14:50,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 22:14:50,858 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:14:50,858 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:50,860 INFO L225 Difference]: With dead ends: 408 [2025-04-13 22:14:50,860 INFO L226 Difference]: Without dead ends: 381 [2025-04-13 22:14:50,861 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2071 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=798, Invalid=5522, Unknown=0, NotChecked=0, Total=6320 [2025-04-13 22:14:50,861 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 210 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:50,861 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 0 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:14:50,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-04-13 22:14:51,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 273. [2025-04-13 22:14:51,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 3.0330882352941178) internal successors, (825), 272 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:51,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 825 transitions. [2025-04-13 22:14:51,186 INFO L79 Accepts]: Start accepts. Automaton has 273 states and 825 transitions. Word has length 28 [2025-04-13 22:14:51,186 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:51,186 INFO L485 AbstractCegarLoop]: Abstraction has 273 states and 825 transitions. [2025-04-13 22:14:51,186 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:51,186 INFO L278 IsEmpty]: Start isEmpty. Operand 273 states and 825 transitions. [2025-04-13 22:14:51,186 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:51,186 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:51,186 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:51,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2025-04-13 22:14:51,387 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:51,387 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:14:51,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:51,387 INFO L85 PathProgramCache]: Analyzing trace with hash -340088143, now seen corresponding path program 43 times [2025-04-13 22:14:51,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:51,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194152684] [2025-04-13 22:14:51,387 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:14:51,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:51,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:14:51,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:51,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:51,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:14:51,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:51,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194152684] [2025-04-13 22:14:51,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194152684] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:51,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805516941] [2025-04-13 22:14:51,929 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:14:51,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:51,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:51,931 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:14:51,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2025-04-13 22:14:52,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:14:52,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:52,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:52,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:52,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 22:14:52,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:52,305 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:14:52,305 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:14:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:52,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:52,454 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:52,454 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 226 treesize of output 222 [2025-04-13 22:14:52,988 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:52,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805516941] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:52,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:52,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 33 [2025-04-13 22:14:52,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192044852] [2025-04-13 22:14:52,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:52,989 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:14:52,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:52,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:14:52,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=986, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:14:52,989 INFO L87 Difference]: Start difference. First operand 273 states and 825 transitions. Second operand has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:54,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:54,722 INFO L93 Difference]: Finished difference Result 389 states and 1065 transitions. [2025-04-13 22:14:54,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 22:14:54,723 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:14:54,723 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:54,724 INFO L225 Difference]: With dead ends: 389 [2025-04-13 22:14:54,724 INFO L226 Difference]: Without dead ends: 358 [2025-04-13 22:14:54,725 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1305 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=542, Invalid=4428, Unknown=0, NotChecked=0, Total=4970 [2025-04-13 22:14:54,725 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 193 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:54,725 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 0 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:14:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-04-13 22:14:55,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 281. [2025-04-13 22:14:55,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 3.039285714285714) internal successors, (851), 280 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:55,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 851 transitions. [2025-04-13 22:14:55,039 INFO L79 Accepts]: Start accepts. Automaton has 281 states and 851 transitions. Word has length 28 [2025-04-13 22:14:55,040 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:55,040 INFO L485 AbstractCegarLoop]: Abstraction has 281 states and 851 transitions. [2025-04-13 22:14:55,040 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:55,040 INFO L278 IsEmpty]: Start isEmpty. Operand 281 states and 851 transitions. [2025-04-13 22:14:55,040 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:55,040 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:55,040 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:55,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2025-04-13 22:14:55,240 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2025-04-13 22:14:55,241 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:14:55,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:55,241 INFO L85 PathProgramCache]: Analyzing trace with hash -229265623, now seen corresponding path program 44 times [2025-04-13 22:14:55,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:55,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492329245] [2025-04-13 22:14:55,241 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:14:55,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:55,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:55,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:55,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:14:55,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:55,645 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:55,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:55,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492329245] [2025-04-13 22:14:55,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492329245] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:55,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948170139] [2025-04-13 22:14:55,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:14:55,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:55,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:55,647 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:14:55,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2025-04-13 22:14:55,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:55,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:55,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:14:55,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:55,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:14:55,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:56,135 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:14:56,135 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:14:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:14:56,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:56,297 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:56,297 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 22:14:57,017 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:57,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948170139] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:57,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:57,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 32 [2025-04-13 22:14:57,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445571437] [2025-04-13 22:14:57,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:57,018 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:14:57,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:57,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:14:57,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=920, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:14:57,018 INFO L87 Difference]: Start difference. First operand 281 states and 851 transitions. Second operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:59,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:59,203 INFO L93 Difference]: Finished difference Result 421 states and 1130 transitions. [2025-04-13 22:14:59,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-13 22:14:59,204 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:14:59,204 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:59,205 INFO L225 Difference]: With dead ends: 421 [2025-04-13 22:14:59,205 INFO L226 Difference]: Without dead ends: 364 [2025-04-13 22:14:59,206 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2046 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=742, Invalid=5420, Unknown=0, NotChecked=0, Total=6162 [2025-04-13 22:14:59,206 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 243 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:59,206 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 0 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:14:59,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-04-13 22:14:59,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 277. [2025-04-13 22:14:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 3.003623188405797) internal successors, (829), 276 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 829 transitions. [2025-04-13 22:14:59,520 INFO L79 Accepts]: Start accepts. Automaton has 277 states and 829 transitions. Word has length 28 [2025-04-13 22:14:59,520 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:59,520 INFO L485 AbstractCegarLoop]: Abstraction has 277 states and 829 transitions. [2025-04-13 22:14:59,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:59,520 INFO L278 IsEmpty]: Start isEmpty. Operand 277 states and 829 transitions. [2025-04-13 22:14:59,521 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:59,521 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:59,521 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:59,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2025-04-13 22:14:59,721 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:59,721 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:14:59,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:59,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1088734799, now seen corresponding path program 45 times [2025-04-13 22:14:59,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:59,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145000393] [2025-04-13 22:14:59,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:14:59,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:59,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:59,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-13 22:14:59,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:14:59,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:00,064 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:00,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:00,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145000393] [2025-04-13 22:15:00,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145000393] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:00,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686714074] [2025-04-13 22:15:00,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:00,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:00,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:00,067 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:15:00,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2025-04-13 22:15:00,281 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:15:00,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-13 22:15:00,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:15:00,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:00,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:15:00,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:00,549 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:15:00,549 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:15:00,573 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:00,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:00,734 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:00,734 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 22:15:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:01,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686714074] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:01,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:01,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 29 [2025-04-13 22:15:01,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245744589] [2025-04-13 22:15:01,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:01,402 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:15:01,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:01,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:15:01,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:15:01,403 INFO L87 Difference]: Start difference. First operand 277 states and 829 transitions. Second operand has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:02,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:02,831 INFO L93 Difference]: Finished difference Result 340 states and 974 transitions. [2025-04-13 22:15:02,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:15:02,832 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:15:02,832 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:02,833 INFO L225 Difference]: With dead ends: 340 [2025-04-13 22:15:02,833 INFO L226 Difference]: Without dead ends: 313 [2025-04-13 22:15:02,834 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=367, Invalid=2389, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:15:02,834 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:02,834 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:15:02,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-04-13 22:15:03,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 277. [2025-04-13 22:15:03,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 2.9818840579710146) internal successors, (823), 276 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:03,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 823 transitions. [2025-04-13 22:15:03,170 INFO L79 Accepts]: Start accepts. Automaton has 277 states and 823 transitions. Word has length 28 [2025-04-13 22:15:03,170 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:03,170 INFO L485 AbstractCegarLoop]: Abstraction has 277 states and 823 transitions. [2025-04-13 22:15:03,170 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:03,170 INFO L278 IsEmpty]: Start isEmpty. Operand 277 states and 823 transitions. [2025-04-13 22:15:03,170 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:15:03,170 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:03,170 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:03,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2025-04-13 22:15:03,371 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:03,371 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:15:03,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:03,371 INFO L85 PathProgramCache]: Analyzing trace with hash -68043403, now seen corresponding path program 46 times [2025-04-13 22:15:03,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:03,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706819201] [2025-04-13 22:15:03,371 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:03,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:03,380 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:15:03,383 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 22:15:03,383 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:15:03,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:03,576 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:03,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:03,576 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706819201] [2025-04-13 22:15:03,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706819201] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:03,576 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669583298] [2025-04-13 22:15:03,576 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:03,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:03,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:03,578 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:15:03,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2025-04-13 22:15:03,770 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:15:03,777 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 22:15:03,777 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:15:03,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:03,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 22:15:03,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:03,917 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:15:03,918 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:15:03,938 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:03,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:04,122 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:04,123 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 197 [2025-04-13 22:15:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:04,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669583298] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:04,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:04,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-04-13 22:15:04,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078923270] [2025-04-13 22:15:04,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:04,655 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:15:04,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:04,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:15:04,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:15:04,655 INFO L87 Difference]: Start difference. First operand 277 states and 823 transitions. Second operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:06,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:06,109 INFO L93 Difference]: Finished difference Result 371 states and 1040 transitions. [2025-04-13 22:15:06,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:15:06,109 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:15:06,109 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:06,111 INFO L225 Difference]: With dead ends: 371 [2025-04-13 22:15:06,111 INFO L226 Difference]: Without dead ends: 346 [2025-04-13 22:15:06,111 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=249, Invalid=1731, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:15:06,111 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 134 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:06,111 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 0 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:15:06,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-04-13 22:15:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 285. [2025-04-13 22:15:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 2.98943661971831) internal successors, (849), 284 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 849 transitions. [2025-04-13 22:15:06,470 INFO L79 Accepts]: Start accepts. Automaton has 285 states and 849 transitions. Word has length 28 [2025-04-13 22:15:06,470 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:06,470 INFO L485 AbstractCegarLoop]: Abstraction has 285 states and 849 transitions. [2025-04-13 22:15:06,470 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:06,470 INFO L278 IsEmpty]: Start isEmpty. Operand 285 states and 849 transitions. [2025-04-13 22:15:06,470 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:15:06,470 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:06,470 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:06,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2025-04-13 22:15:06,671 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:06,671 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:15:06,671 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:06,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1504921397, now seen corresponding path program 47 times [2025-04-13 22:15:06,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:06,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243018373] [2025-04-13 22:15:06,671 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:06,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:06,681 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:15:06,696 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:15:06,696 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:15:06,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:07,076 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:15:07,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:07,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243018373] [2025-04-13 22:15:07,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243018373] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:07,076 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26182477] [2025-04-13 22:15:07,076 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:07,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:07,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:07,078 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:15:07,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2025-04-13 22:15:07,280 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:15:07,360 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:15:07,360 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:15:07,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:07,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:15:07,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:07,540 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:15:07,540 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 22:15:07,564 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:15:07,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:07,693 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:07,693 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 191 [2025-04-13 22:15:08,146 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:08,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26182477] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:08,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:08,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 28 [2025-04-13 22:15:08,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616425348] [2025-04-13 22:15:08,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:08,147 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:15:08,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:08,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:15:08,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:15:08,147 INFO L87 Difference]: Start difference. First operand 285 states and 849 transitions. Second operand has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:09,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:09,976 INFO L93 Difference]: Finished difference Result 422 states and 1131 transitions. [2025-04-13 22:15:09,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 22:15:09,976 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:15:09,976 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:09,978 INFO L225 Difference]: With dead ends: 422 [2025-04-13 22:15:09,978 INFO L226 Difference]: Without dead ends: 403 [2025-04-13 22:15:09,978 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=470, Invalid=3820, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 22:15:09,979 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 193 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:09,979 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 0 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:15:09,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-04-13 22:15:10,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 295. [2025-04-13 22:15:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 3.0272108843537415) internal successors, (890), 294 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 890 transitions. [2025-04-13 22:15:10,337 INFO L79 Accepts]: Start accepts. Automaton has 295 states and 890 transitions. Word has length 28 [2025-04-13 22:15:10,337 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:10,337 INFO L485 AbstractCegarLoop]: Abstraction has 295 states and 890 transitions. [2025-04-13 22:15:10,337 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:10,337 INFO L278 IsEmpty]: Start isEmpty. Operand 295 states and 890 transitions. [2025-04-13 22:15:10,338 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:15:10,338 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:10,338 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:10,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2025-04-13 22:15:10,538 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:10,538 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:15:10,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:10,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1507429607, now seen corresponding path program 48 times [2025-04-13 22:15:10,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:10,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395199112] [2025-04-13 22:15:10,539 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:15:10,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:10,548 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:15:10,563 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:15:10,563 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:15:10,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:10,969 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:10,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:10,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395199112] [2025-04-13 22:15:10,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395199112] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:10,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271862968] [2025-04-13 22:15:10,970 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:15:10,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:10,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:10,972 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:15:10,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2025-04-13 22:15:11,165 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:15:11,191 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:15:11,192 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:15:11,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:11,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 22:15:11,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:11,358 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:15:11,358 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:15:11,382 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:15:11,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:11,652 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-13 22:15:11,653 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 187 treesize of output 233 [2025-04-13 22:15:12,900 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:12,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271862968] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:12,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:12,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 25 [2025-04-13 22:15:12,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889489224] [2025-04-13 22:15:12,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:12,900 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:15:12,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:12,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:15:12,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:15:12,901 INFO L87 Difference]: Start difference. First operand 295 states and 890 transitions. Second operand has 26 states, 25 states have (on average 1.88) internal successors, (47), 26 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:15,790 INFO L93 Difference]: Finished difference Result 543 states and 1406 transitions. [2025-04-13 22:15:15,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-13 22:15:15,790 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 26 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:15:15,790 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:15,792 INFO L225 Difference]: With dead ends: 543 [2025-04-13 22:15:15,792 INFO L226 Difference]: Without dead ends: 514 [2025-04-13 22:15:15,793 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1914 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=828, Invalid=4872, Unknown=0, NotChecked=0, Total=5700 [2025-04-13 22:15:15,793 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 250 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:15,793 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 0 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:15:15,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-04-13 22:15:16,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 317. [2025-04-13 22:15:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 3.1107594936708862) internal successors, (983), 316 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:16,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 983 transitions. [2025-04-13 22:15:16,197 INFO L79 Accepts]: Start accepts. Automaton has 317 states and 983 transitions. Word has length 28 [2025-04-13 22:15:16,197 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:16,197 INFO L485 AbstractCegarLoop]: Abstraction has 317 states and 983 transitions. [2025-04-13 22:15:16,197 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 26 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:16,197 INFO L278 IsEmpty]: Start isEmpty. Operand 317 states and 983 transitions. [2025-04-13 22:15:16,198 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:15:16,198 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:16,198 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:16,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2025-04-13 22:15:16,398 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2025-04-13 22:15:16,398 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:15:16,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:16,398 INFO L85 PathProgramCache]: Analyzing trace with hash -224125937, now seen corresponding path program 49 times [2025-04-13 22:15:16,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:16,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836226663] [2025-04-13 22:15:16,399 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:16,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:16,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:15:16,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:15:16,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:16,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:16,923 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:15:16,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:16,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836226663] [2025-04-13 22:15:16,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836226663] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:16,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436305985] [2025-04-13 22:15:16,923 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:16,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:16,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:16,925 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:15:16,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2025-04-13 22:15:17,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:15:17,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:15:17,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:17,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:17,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 22:15:17,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:17,314 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:15:17,315 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:15:17,336 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:17,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:17,480 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:17,481 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 210 treesize of output 206 [2025-04-13 22:15:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:18,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436305985] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:18,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:18,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 33 [2025-04-13 22:15:18,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135402054] [2025-04-13 22:15:18,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:18,077 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:15:18,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:18,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:15:18,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=991, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:15:18,077 INFO L87 Difference]: Start difference. First operand 317 states and 983 transitions. Second operand has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:20,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:20,145 INFO L93 Difference]: Finished difference Result 437 states and 1197 transitions. [2025-04-13 22:15:20,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 22:15:20,145 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:15:20,146 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:20,147 INFO L225 Difference]: With dead ends: 437 [2025-04-13 22:15:20,147 INFO L226 Difference]: Without dead ends: 402 [2025-04-13 22:15:20,148 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1643 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=703, Invalid=5303, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 22:15:20,148 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 210 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:20,148 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 0 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:15:20,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-04-13 22:15:20,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 321. [2025-04-13 22:15:20,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 3.103125) internal successors, (993), 320 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:20,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 993 transitions. [2025-04-13 22:15:20,555 INFO L79 Accepts]: Start accepts. Automaton has 321 states and 993 transitions. Word has length 28 [2025-04-13 22:15:20,555 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:20,555 INFO L485 AbstractCegarLoop]: Abstraction has 321 states and 993 transitions. [2025-04-13 22:15:20,555 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:20,555 INFO L278 IsEmpty]: Start isEmpty. Operand 321 states and 993 transitions. [2025-04-13 22:15:20,556 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:15:20,556 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:20,556 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:20,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2025-04-13 22:15:20,756 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2025-04-13 22:15:20,757 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:15:20,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:20,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1942469643, now seen corresponding path program 50 times [2025-04-13 22:15:20,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:20,757 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99147302] [2025-04-13 22:15:20,757 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:20,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:20,766 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:15:20,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:15:20,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:20,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:21,153 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:21,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:21,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99147302] [2025-04-13 22:15:21,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99147302] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:21,154 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310561529] [2025-04-13 22:15:21,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:21,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:21,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:21,155 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:15:21,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2025-04-13 22:15:21,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:15:21,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:15:21,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:21,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:21,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:15:21,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:21,543 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:15:21,544 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:15:21,562 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:15:21,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:21,682 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:21,682 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 191 [2025-04-13 22:15:22,188 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:22,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310561529] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:22,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:22,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 26 [2025-04-13 22:15:22,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596791993] [2025-04-13 22:15:22,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:22,188 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:15:22,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:22,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:15:22,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:15:22,189 INFO L87 Difference]: Start difference. First operand 321 states and 993 transitions. Second operand has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:24,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:24,009 INFO L93 Difference]: Finished difference Result 465 states and 1294 transitions. [2025-04-13 22:15:24,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 22:15:24,009 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:15:24,009 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:24,011 INFO L225 Difference]: With dead ends: 465 [2025-04-13 22:15:24,011 INFO L226 Difference]: Without dead ends: 442 [2025-04-13 22:15:24,011 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=466, Invalid=3074, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 22:15:24,012 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 156 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:24,012 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 0 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:15:24,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-04-13 22:15:24,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 333. [2025-04-13 22:15:24,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 3.147590361445783) internal successors, (1045), 332 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 1045 transitions. [2025-04-13 22:15:24,423 INFO L79 Accepts]: Start accepts. Automaton has 333 states and 1045 transitions. Word has length 28 [2025-04-13 22:15:24,423 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:24,423 INFO L485 AbstractCegarLoop]: Abstraction has 333 states and 1045 transitions. [2025-04-13 22:15:24,423 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:24,423 INFO L278 IsEmpty]: Start isEmpty. Operand 333 states and 1045 transitions. [2025-04-13 22:15:24,424 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:15:24,424 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:24,424 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:24,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2025-04-13 22:15:24,624 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2025-04-13 22:15:24,625 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:15:24,625 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:24,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1939961433, now seen corresponding path program 51 times [2025-04-13 22:15:24,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:24,625 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142817126] [2025-04-13 22:15:24,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:24,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:24,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:15:24,653 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 28 statements. [2025-04-13 22:15:24,654 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:15:24,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:25,036 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:25,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:25,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142817126] [2025-04-13 22:15:25,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142817126] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:25,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276353992] [2025-04-13 22:15:25,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:25,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:25,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:25,038 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:15:25,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2025-04-13 22:15:25,245 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:15:25,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 28 statements. [2025-04-13 22:15:25,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:15:25,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:25,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:15:25,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:25,442 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:15:25,443 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:15:25,464 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:25,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:25,581 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:25,581 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 22:15:26,044 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:26,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276353992] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:26,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:26,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 30 [2025-04-13 22:15:26,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952032690] [2025-04-13 22:15:26,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:26,044 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:15:26,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:26,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:15:26,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:15:26,045 INFO L87 Difference]: Start difference. First operand 333 states and 1045 transitions. Second operand has 31 states, 30 states have (on average 1.9) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:27,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:27,925 INFO L93 Difference]: Finished difference Result 458 states and 1270 transitions. [2025-04-13 22:15:27,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 22:15:27,925 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:15:27,926 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:27,927 INFO L225 Difference]: With dead ends: 458 [2025-04-13 22:15:27,927 INFO L226 Difference]: Without dead ends: 427 [2025-04-13 22:15:27,928 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1276 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=540, Invalid=3750, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 22:15:27,928 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 166 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:27,928 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 0 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:15:27,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-04-13 22:15:28,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 326. [2025-04-13 22:15:28,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 3.1323076923076925) internal successors, (1018), 325 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:28,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 1018 transitions. [2025-04-13 22:15:28,321 INFO L79 Accepts]: Start accepts. Automaton has 326 states and 1018 transitions. Word has length 28 [2025-04-13 22:15:28,321 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:28,321 INFO L485 AbstractCegarLoop]: Abstraction has 326 states and 1018 transitions. [2025-04-13 22:15:28,321 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:28,321 INFO L278 IsEmpty]: Start isEmpty. Operand 326 states and 1018 transitions. [2025-04-13 22:15:28,321 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:15:28,321 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:28,321 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:28,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2025-04-13 22:15:28,522 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:28,522 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:15:28,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:28,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1829138913, now seen corresponding path program 52 times [2025-04-13 22:15:28,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:28,522 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666512729] [2025-04-13 22:15:28,522 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:28,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:28,531 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:15:28,535 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 22:15:28,535 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:15:28,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:28,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:28,750 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666512729] [2025-04-13 22:15:28,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666512729] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:28,750 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945815235] [2025-04-13 22:15:28,750 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:28,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:28,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:28,752 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:15:28,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2025-04-13 22:15:28,958 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:15:28,966 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 22:15:28,966 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:15:28,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:28,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 22:15:28,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:29,092 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:15:29,092 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:15:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:29,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:29,247 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:29,247 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 22:15:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:29,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945815235] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:29,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:29,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-04-13 22:15:29,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446727465] [2025-04-13 22:15:29,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:29,765 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:15:29,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:29,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:15:29,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:15:29,765 INFO L87 Difference]: Start difference. First operand 326 states and 1018 transitions. Second operand has 23 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:31,436 INFO L93 Difference]: Finished difference Result 433 states and 1250 transitions. [2025-04-13 22:15:31,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:15:31,436 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:15:31,436 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:31,438 INFO L225 Difference]: With dead ends: 433 [2025-04-13 22:15:31,438 INFO L226 Difference]: Without dead ends: 414 [2025-04-13 22:15:31,438 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=1990, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:15:31,438 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 130 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:31,438 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 0 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:15:31,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-04-13 22:15:31,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 332. [2025-04-13 22:15:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 3.1389728096676737) internal successors, (1039), 331 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:31,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 1039 transitions. [2025-04-13 22:15:31,866 INFO L79 Accepts]: Start accepts. Automaton has 332 states and 1039 transitions. Word has length 28 [2025-04-13 22:15:31,866 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:31,866 INFO L485 AbstractCegarLoop]: Abstraction has 332 states and 1039 transitions. [2025-04-13 22:15:31,866 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:31,867 INFO L278 IsEmpty]: Start isEmpty. Operand 332 states and 1039 transitions. [2025-04-13 22:15:31,867 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:15:31,867 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:31,867 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:31,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2025-04-13 22:15:32,067 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:32,068 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:15:32,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:32,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1960826407, now seen corresponding path program 53 times [2025-04-13 22:15:32,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:32,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26903334] [2025-04-13 22:15:32,068 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:32,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:32,077 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:15:32,091 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:15:32,091 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:15:32,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:15:32,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:32,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26903334] [2025-04-13 22:15:32,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26903334] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:32,463 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222617016] [2025-04-13 22:15:32,463 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:32,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:32,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:32,465 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:15:32,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2025-04-13 22:15:32,680 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:15:32,729 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:15:32,729 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:15:32,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:32,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:15:32,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:32,933 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:15:32,933 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 22:15:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:15:32,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:33,107 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:33,107 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 197 [2025-04-13 22:15:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:33,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222617016] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:33,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:33,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9] total 28 [2025-04-13 22:15:33,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886741164] [2025-04-13 22:15:33,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:33,556 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:15:33,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:33,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:15:33,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:15:33,556 INFO L87 Difference]: Start difference. First operand 332 states and 1039 transitions. Second operand has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:35,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:35,416 INFO L93 Difference]: Finished difference Result 417 states and 1228 transitions. [2025-04-13 22:15:35,416 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 22:15:35,416 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:15:35,416 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:35,418 INFO L225 Difference]: With dead ends: 417 [2025-04-13 22:15:35,418 INFO L226 Difference]: Without dead ends: 392 [2025-04-13 22:15:35,419 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=397, Invalid=3385, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 22:15:35,419 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 155 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:35,419 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 0 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:15:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-04-13 22:15:35,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 338. [2025-04-13 22:15:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 3.14540059347181) internal successors, (1060), 337 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1060 transitions. [2025-04-13 22:15:35,849 INFO L79 Accepts]: Start accepts. Automaton has 338 states and 1060 transitions. Word has length 28 [2025-04-13 22:15:35,849 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:35,849 INFO L485 AbstractCegarLoop]: Abstraction has 338 states and 1060 transitions. [2025-04-13 22:15:35,849 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:35,849 INFO L278 IsEmpty]: Start isEmpty. Operand 338 states and 1060 transitions. [2025-04-13 22:15:35,849 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:15:35,850 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:35,850 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:35,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2025-04-13 22:15:36,050 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:36,050 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:15:36,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:36,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1437409483, now seen corresponding path program 54 times [2025-04-13 22:15:36,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:36,051 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045480054] [2025-04-13 22:15:36,051 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:15:36,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:36,060 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:15:36,075 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:15:36,076 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:15:36,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:36,473 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:36,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:36,474 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045480054] [2025-04-13 22:15:36,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045480054] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:36,474 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465201798] [2025-04-13 22:15:36,474 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:15:36,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:36,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:36,476 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:15:36,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2025-04-13 22:15:36,697 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:15:36,725 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:15:36,725 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:15:36,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:36,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:15:36,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:36,983 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:15:36,983 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:15:37,002 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:37,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:37,141 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:37,141 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 210 treesize of output 206 [2025-04-13 22:15:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:37,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465201798] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:37,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:37,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 30 [2025-04-13 22:15:37,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919364198] [2025-04-13 22:15:37,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:37,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:15:37,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:37,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:15:37,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:15:37,618 INFO L87 Difference]: Start difference. First operand 338 states and 1060 transitions. Second operand has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:39,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:39,337 INFO L93 Difference]: Finished difference Result 470 states and 1342 transitions. [2025-04-13 22:15:39,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 22:15:39,338 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:15:39,338 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:39,340 INFO L225 Difference]: With dead ends: 470 [2025-04-13 22:15:39,340 INFO L226 Difference]: Without dead ends: 451 [2025-04-13 22:15:39,340 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=444, Invalid=3216, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 22:15:39,340 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 166 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:39,340 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 0 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:15:39,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-04-13 22:15:39,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 354. [2025-04-13 22:15:39,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 3.178470254957507) internal successors, (1122), 353 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:39,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1122 transitions. [2025-04-13 22:15:39,784 INFO L79 Accepts]: Start accepts. Automaton has 354 states and 1122 transitions. Word has length 28 [2025-04-13 22:15:39,784 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:39,784 INFO L485 AbstractCegarLoop]: Abstraction has 354 states and 1122 transitions. [2025-04-13 22:15:39,784 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:39,784 INFO L278 IsEmpty]: Start isEmpty. Operand 354 states and 1122 transitions. [2025-04-13 22:15:39,785 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:15:39,785 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:39,785 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:39,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2025-04-13 22:15:39,985 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:39,985 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:15:39,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:39,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1434901273, now seen corresponding path program 55 times [2025-04-13 22:15:39,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:39,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930662869] [2025-04-13 22:15:39,986 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:39,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:39,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:15:40,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:15:40,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:40,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:40,511 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:15:40,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:40,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930662869] [2025-04-13 22:15:40,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930662869] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:40,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614779480] [2025-04-13 22:15:40,511 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:40,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:40,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:40,513 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:15:40,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2025-04-13 22:15:40,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:15:40,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:15:40,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:40,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:40,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 22:15:40,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:40,882 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:15:40,882 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:15:40,909 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:40,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:41,020 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:41,020 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 22:15:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:41,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614779480] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:41,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:41,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 31 [2025-04-13 22:15:41,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937640813] [2025-04-13 22:15:41,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:41,504 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:15:41,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:41,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:15:41,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=891, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:15:41,505 INFO L87 Difference]: Start difference. First operand 354 states and 1122 transitions. Second operand has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:43,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:43,712 INFO L93 Difference]: Finished difference Result 463 states and 1327 transitions. [2025-04-13 22:15:43,712 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 22:15:43,712 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:15:43,712 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:43,715 INFO L225 Difference]: With dead ends: 463 [2025-04-13 22:15:43,715 INFO L226 Difference]: Without dead ends: 446 [2025-04-13 22:15:43,715 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=490, Invalid=4202, Unknown=0, NotChecked=0, Total=4692 [2025-04-13 22:15:43,716 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 210 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:43,716 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 0 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:15:43,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-04-13 22:15:44,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 356. [2025-04-13 22:15:44,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 3.174647887323944) internal successors, (1127), 355 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 1127 transitions. [2025-04-13 22:15:44,195 INFO L79 Accepts]: Start accepts. Automaton has 356 states and 1127 transitions. Word has length 28 [2025-04-13 22:15:44,195 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:44,195 INFO L485 AbstractCegarLoop]: Abstraction has 356 states and 1127 transitions. [2025-04-13 22:15:44,195 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:44,195 INFO L278 IsEmpty]: Start isEmpty. Operand 356 states and 1127 transitions. [2025-04-13 22:15:44,196 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:15:44,196 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:44,196 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:44,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2025-04-13 22:15:44,396 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:44,396 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:15:44,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:44,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1324078753, now seen corresponding path program 56 times [2025-04-13 22:15:44,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:44,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951818818] [2025-04-13 22:15:44,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:44,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:44,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:15:44,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:15:44,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:44,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:44,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:44,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951818818] [2025-04-13 22:15:44,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951818818] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:44,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499748348] [2025-04-13 22:15:44,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:44,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:44,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:44,790 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:15:44,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2025-04-13 22:15:45,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:15:45,027 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:15:45,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:45,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:45,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:15:45,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:45,329 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:15:45,330 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:15:45,353 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:15:45,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:45,486 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:45,486 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 22:15:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:46,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499748348] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:46,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:46,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 32 [2025-04-13 22:15:46,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803416118] [2025-04-13 22:15:46,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:46,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:15:46,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:46,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:15:46,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=930, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:15:46,325 INFO L87 Difference]: Start difference. First operand 356 states and 1127 transitions. Second operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:48,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:48,250 INFO L93 Difference]: Finished difference Result 455 states and 1305 transitions. [2025-04-13 22:15:48,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 22:15:48,250 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:15:48,250 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:48,252 INFO L225 Difference]: With dead ends: 455 [2025-04-13 22:15:48,252 INFO L226 Difference]: Without dead ends: 413 [2025-04-13 22:15:48,252 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1294 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=491, Invalid=3799, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 22:15:48,253 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 201 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:48,253 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 0 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:15:48,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-04-13 22:15:48,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 344. [2025-04-13 22:15:48,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 3.139941690962099) internal successors, (1077), 343 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:48,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 1077 transitions. [2025-04-13 22:15:48,697 INFO L79 Accepts]: Start accepts. Automaton has 344 states and 1077 transitions. Word has length 28 [2025-04-13 22:15:48,697 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:48,697 INFO L485 AbstractCegarLoop]: Abstraction has 344 states and 1077 transitions. [2025-04-13 22:15:48,697 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:48,697 INFO L278 IsEmpty]: Start isEmpty. Operand 344 states and 1077 transitions. [2025-04-13 22:15:48,697 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:15:48,697 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:48,697 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:48,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2025-04-13 22:15:48,898 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable74 [2025-04-13 22:15:48,898 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:15:48,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:48,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2111419367, now seen corresponding path program 57 times [2025-04-13 22:15:48,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:48,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400770890] [2025-04-13 22:15:48,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:48,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:48,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:15:48,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-13 22:15:48,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:15:48,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:49,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:49,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400770890] [2025-04-13 22:15:49,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400770890] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:49,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556381523] [2025-04-13 22:15:49,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:49,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:49,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:49,272 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:15:49,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2025-04-13 22:15:49,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:15:49,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-13 22:15:49,511 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:15:49,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:49,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:15:49,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:49,658 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:15:49,658 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:15:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:49,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:49,836 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:49,837 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 22:15:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:50,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556381523] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:50,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:50,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 23 [2025-04-13 22:15:50,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429396993] [2025-04-13 22:15:50,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:50,355 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:15:50,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:50,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:15:50,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:15:50,355 INFO L87 Difference]: Start difference. First operand 344 states and 1077 transitions. Second operand has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:51,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:51,923 INFO L93 Difference]: Finished difference Result 398 states and 1191 transitions. [2025-04-13 22:15:51,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:15:51,923 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:15:51,924 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:51,925 INFO L225 Difference]: With dead ends: 398 [2025-04-13 22:15:51,925 INFO L226 Difference]: Without dead ends: 377 [2025-04-13 22:15:51,925 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=255, Invalid=1725, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:15:51,926 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:51,926 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:15:51,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-04-13 22:15:52,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 346. [2025-04-13 22:15:52,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 3.136231884057971) internal successors, (1082), 345 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1082 transitions. [2025-04-13 22:15:52,372 INFO L79 Accepts]: Start accepts. Automaton has 346 states and 1082 transitions. Word has length 28 [2025-04-13 22:15:52,372 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:52,372 INFO L485 AbstractCegarLoop]: Abstraction has 346 states and 1082 transitions. [2025-04-13 22:15:52,372 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:52,372 INFO L278 IsEmpty]: Start isEmpty. Operand 346 states and 1082 transitions. [2025-04-13 22:15:52,373 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:15:52,373 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:52,373 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:52,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2025-04-13 22:15:52,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2025-04-13 22:15:52,573 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:15:52,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:52,574 INFO L85 PathProgramCache]: Analyzing trace with hash -185344353, now seen corresponding path program 58 times [2025-04-13 22:15:52,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:52,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924953958] [2025-04-13 22:15:52,574 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:52,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:52,583 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:15:52,586 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 22:15:52,586 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:15:52,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:52,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:52,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924953958] [2025-04-13 22:15:52,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924953958] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:52,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546277617] [2025-04-13 22:15:52,772 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:52,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:52,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:52,774 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:15:52,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2025-04-13 22:15:53,015 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:15:53,023 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 22:15:53,023 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:15:53,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:53,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 22:15:53,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:53,139 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:15:53,140 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:15:53,159 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:53,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:53,295 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:53,295 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 197 [2025-04-13 22:15:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:53,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546277617] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:53,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:53,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-04-13 22:15:53,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278345850] [2025-04-13 22:15:53,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:53,705 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:15:53,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:53,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:15:53,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:15:53,706 INFO L87 Difference]: Start difference. First operand 346 states and 1082 transitions. Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:55,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:55,644 INFO L93 Difference]: Finished difference Result 489 states and 1410 transitions. [2025-04-13 22:15:55,644 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 22:15:55,644 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:15:55,644 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:55,646 INFO L225 Difference]: With dead ends: 489 [2025-04-13 22:15:55,646 INFO L226 Difference]: Without dead ends: 457 [2025-04-13 22:15:55,646 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=319, Invalid=2231, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:15:55,646 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 158 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:55,646 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 0 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:15:55,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-04-13 22:15:56,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 350. [2025-04-13 22:15:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 3.140401146131805) internal successors, (1096), 349 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:56,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1096 transitions. [2025-04-13 22:15:56,120 INFO L79 Accepts]: Start accepts. Automaton has 350 states and 1096 transitions. Word has length 28 [2025-04-13 22:15:56,120 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:56,120 INFO L485 AbstractCegarLoop]: Abstraction has 350 states and 1096 transitions. [2025-04-13 22:15:56,120 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:56,120 INFO L278 IsEmpty]: Start isEmpty. Operand 350 states and 1096 transitions. [2025-04-13 22:15:56,120 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:15:56,120 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:56,120 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:56,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2025-04-13 22:15:56,321 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2025-04-13 22:15:56,321 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:15:56,321 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:56,321 INFO L85 PathProgramCache]: Analyzing trace with hash -133680993, now seen corresponding path program 59 times [2025-04-13 22:15:56,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:56,321 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735622926] [2025-04-13 22:15:56,321 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:56,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:56,331 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:15:56,358 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:15:56,358 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:15:56,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:15:57,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:57,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735622926] [2025-04-13 22:15:57,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735622926] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:57,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260399233] [2025-04-13 22:15:57,039 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:57,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:57,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:57,041 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:15:57,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2025-04-13 22:15:57,265 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:15:57,395 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:15:57,395 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:15:57,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:57,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:15:57,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:57,613 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:15:57,614 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 22:15:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:15:57,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:57,758 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:57,759 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 22:15:58,296 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:58,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260399233] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:58,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:58,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 9] total 37 [2025-04-13 22:15:58,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496939332] [2025-04-13 22:15:58,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:58,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 22:15:58,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:58,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 22:15:58,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1274, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:15:58,298 INFO L87 Difference]: Start difference. First operand 350 states and 1096 transitions. Second operand has 38 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 38 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:00,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:00,926 INFO L93 Difference]: Finished difference Result 531 states and 1485 transitions. [2025-04-13 22:16:00,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 22:16:00,926 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 38 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:16:00,926 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:00,928 INFO L225 Difference]: With dead ends: 531 [2025-04-13 22:16:00,928 INFO L226 Difference]: Without dead ends: 501 [2025-04-13 22:16:00,928 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1434 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=606, Invalid=5714, Unknown=0, NotChecked=0, Total=6320 [2025-04-13 22:16:00,929 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 209 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:00,929 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 0 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1639 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:16:00,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-04-13 22:16:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 356. [2025-04-13 22:16:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 3.140845070422535) internal successors, (1115), 355 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:01,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 1115 transitions. [2025-04-13 22:16:01,387 INFO L79 Accepts]: Start accepts. Automaton has 356 states and 1115 transitions. Word has length 28 [2025-04-13 22:16:01,387 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:01,387 INFO L485 AbstractCegarLoop]: Abstraction has 356 states and 1115 transitions. [2025-04-13 22:16:01,387 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 38 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:01,387 INFO L278 IsEmpty]: Start isEmpty. Operand 356 states and 1115 transitions. [2025-04-13 22:16:01,387 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:16:01,387 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:01,387 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:01,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2025-04-13 22:16:01,588 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2025-04-13 22:16:01,588 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:01,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:01,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1741202179, now seen corresponding path program 60 times [2025-04-13 22:16:01,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:01,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430684192] [2025-04-13 22:16:01,588 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:16:01,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:01,601 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:16:01,610 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 22:16:01,610 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:16:01,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:02,008 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:02,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:02,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430684192] [2025-04-13 22:16:02,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430684192] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:02,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521195858] [2025-04-13 22:16:02,009 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:16:02,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:02,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:02,010 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:02,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2025-04-13 22:16:02,245 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:16:02,267 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 22:16:02,267 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:16:02,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:02,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:16:02,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:02,498 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:16:02,499 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:16:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:02,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:02,985 INFO L325 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2025-04-13 22:16:02,986 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 134 treesize of output 190 [2025-04-13 22:16:03,784 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:03,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521195858] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:03,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:03,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 30 [2025-04-13 22:16:03,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613864549] [2025-04-13 22:16:03,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:03,785 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:16:03,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:03,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:16:03,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:16:03,785 INFO L87 Difference]: Start difference. First operand 356 states and 1115 transitions. Second operand has 31 states, 30 states have (on average 1.9) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:07,787 INFO L93 Difference]: Finished difference Result 592 states and 1682 transitions. [2025-04-13 22:16:07,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 22:16:07,787 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:16:07,788 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:07,789 INFO L225 Difference]: With dead ends: 592 [2025-04-13 22:16:07,789 INFO L226 Difference]: Without dead ends: 562 [2025-04-13 22:16:07,790 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1768 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=718, Invalid=5602, Unknown=0, NotChecked=0, Total=6320 [2025-04-13 22:16:07,790 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 249 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:07,790 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 0 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:16:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-04-13 22:16:08,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 362. [2025-04-13 22:16:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 3.1357340720221605) internal successors, (1132), 361 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 1132 transitions. [2025-04-13 22:16:08,313 INFO L79 Accepts]: Start accepts. Automaton has 362 states and 1132 transitions. Word has length 28 [2025-04-13 22:16:08,313 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:08,313 INFO L485 AbstractCegarLoop]: Abstraction has 362 states and 1132 transitions. [2025-04-13 22:16:08,313 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:08,313 INFO L278 IsEmpty]: Start isEmpty. Operand 362 states and 1132 transitions. [2025-04-13 22:16:08,313 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:16:08,314 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:08,314 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:08,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2025-04-13 22:16:08,514 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:08,514 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:08,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:08,514 INFO L85 PathProgramCache]: Analyzing trace with hash 711387053, now seen corresponding path program 61 times [2025-04-13 22:16:08,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:08,515 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538035623] [2025-04-13 22:16:08,515 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:16:08,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:08,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:16:08,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:16:08,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:16:08,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:09,050 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:16:09,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:09,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538035623] [2025-04-13 22:16:09,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538035623] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:09,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590879586] [2025-04-13 22:16:09,051 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:16:09,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:09,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:09,052 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:09,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2025-04-13 22:16:09,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:16:09,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:16:09,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:16:09,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:09,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 22:16:09,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:09,478 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:16:09,478 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:16:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:09,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:09,635 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:09,635 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 210 treesize of output 206 [2025-04-13 22:16:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:10,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590879586] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:10,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:10,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 33 [2025-04-13 22:16:10,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055528896] [2025-04-13 22:16:10,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:10,096 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:16:10,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:10,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:16:10,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1010, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:16:10,096 INFO L87 Difference]: Start difference. First operand 362 states and 1132 transitions. Second operand has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:12,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:12,638 INFO L93 Difference]: Finished difference Result 539 states and 1529 transitions. [2025-04-13 22:16:12,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 22:16:12,638 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:16:12,639 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:12,640 INFO L225 Difference]: With dead ends: 539 [2025-04-13 22:16:12,640 INFO L226 Difference]: Without dead ends: 507 [2025-04-13 22:16:12,641 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1419 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=592, Invalid=5260, Unknown=0, NotChecked=0, Total=5852 [2025-04-13 22:16:12,641 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 221 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:12,641 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 0 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:16:12,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-04-13 22:16:13,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 380. [2025-04-13 22:16:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 3.1477572559366753) internal successors, (1193), 379 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:13,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1193 transitions. [2025-04-13 22:16:13,192 INFO L79 Accepts]: Start accepts. Automaton has 380 states and 1193 transitions. Word has length 28 [2025-04-13 22:16:13,192 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:13,192 INFO L485 AbstractCegarLoop]: Abstraction has 380 states and 1193 transitions. [2025-04-13 22:16:13,192 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:13,192 INFO L278 IsEmpty]: Start isEmpty. Operand 380 states and 1193 transitions. [2025-04-13 22:16:13,193 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:16:13,193 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:13,193 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:13,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2025-04-13 22:16:13,393 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:13,393 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:13,394 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:13,394 INFO L85 PathProgramCache]: Analyzing trace with hash 713895263, now seen corresponding path program 62 times [2025-04-13 22:16:13,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:13,394 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564905736] [2025-04-13 22:16:13,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:16:13,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:13,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:16:13,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:16:13,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:16:13,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:13,846 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:13,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:13,846 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564905736] [2025-04-13 22:16:13,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564905736] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:13,846 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792929738] [2025-04-13 22:16:13,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:16:13,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:13,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:13,848 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:13,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2025-04-13 22:16:14,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:16:14,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:16:14,114 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:16:14,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:14,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:16:14,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:14,388 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:16:14,388 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:16:14,411 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:16:14,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:14,519 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:14,519 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 22:16:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:15,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792929738] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:15,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:15,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 32 [2025-04-13 22:16:15,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279520057] [2025-04-13 22:16:15,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:15,256 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:16:15,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:15,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:16:15,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=929, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:16:15,256 INFO L87 Difference]: Start difference. First operand 380 states and 1193 transitions. Second operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:17,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:17,502 INFO L93 Difference]: Finished difference Result 525 states and 1476 transitions. [2025-04-13 22:16:17,503 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 22:16:17,503 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:16:17,503 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:17,504 INFO L225 Difference]: With dead ends: 525 [2025-04-13 22:16:17,504 INFO L226 Difference]: Without dead ends: 491 [2025-04-13 22:16:17,505 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1484 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=535, Invalid=4295, Unknown=0, NotChecked=0, Total=4830 [2025-04-13 22:16:17,505 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:17,505 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 0 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:16:17,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-04-13 22:16:18,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 382. [2025-04-13 22:16:18,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 3.1286089238845145) internal successors, (1192), 381 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:18,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1192 transitions. [2025-04-13 22:16:18,060 INFO L79 Accepts]: Start accepts. Automaton has 382 states and 1192 transitions. Word has length 28 [2025-04-13 22:16:18,060 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:18,060 INFO L485 AbstractCegarLoop]: Abstraction has 382 states and 1192 transitions. [2025-04-13 22:16:18,060 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:18,060 INFO L278 IsEmpty]: Start isEmpty. Operand 382 states and 1192 transitions. [2025-04-13 22:16:18,061 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:16:18,061 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:18,061 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:18,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2025-04-13 22:16:18,261 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:18,262 INFO L403 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:18,262 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:18,262 INFO L85 PathProgramCache]: Analyzing trace with hash 824717783, now seen corresponding path program 63 times [2025-04-13 22:16:18,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:18,262 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915229011] [2025-04-13 22:16:18,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:16:18,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:18,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:16:18,279 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-13 22:16:18,279 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:16:18,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:18,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:18,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915229011] [2025-04-13 22:16:18,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915229011] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:18,596 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042280385] [2025-04-13 22:16:18,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:16:18,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:18,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:18,597 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:18,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2025-04-13 22:16:18,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:16:18,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-13 22:16:18,854 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:16:18,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:18,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:16:18,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:19,170 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:16:19,170 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:16:19,194 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:19,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:19,715 INFO L325 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2025-04-13 22:16:19,715 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 168 treesize of output 212 [2025-04-13 22:16:20,634 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:20,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042280385] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:20,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:20,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 30 [2025-04-13 22:16:20,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792312760] [2025-04-13 22:16:20,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:20,634 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:16:20,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:20,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:16:20,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:16:20,635 INFO L87 Difference]: Start difference. First operand 382 states and 1192 transitions. Second operand has 31 states, 30 states have (on average 1.9) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:24,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:24,538 INFO L93 Difference]: Finished difference Result 577 states and 1657 transitions. [2025-04-13 22:16:24,538 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 22:16:24,539 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:16:24,539 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:24,540 INFO L225 Difference]: With dead ends: 577 [2025-04-13 22:16:24,540 INFO L226 Difference]: Without dead ends: 543 [2025-04-13 22:16:24,541 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1768 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=739, Invalid=4961, Unknown=0, NotChecked=0, Total=5700 [2025-04-13 22:16:24,541 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 229 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:24,541 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 0 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:16:24,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-04-13 22:16:25,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 388. [2025-04-13 22:16:25,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 3.1291989664082687) internal successors, (1211), 387 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1211 transitions. [2025-04-13 22:16:25,124 INFO L79 Accepts]: Start accepts. Automaton has 388 states and 1211 transitions. Word has length 28 [2025-04-13 22:16:25,124 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:25,124 INFO L485 AbstractCegarLoop]: Abstraction has 388 states and 1211 transitions. [2025-04-13 22:16:25,124 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:25,124 INFO L278 IsEmpty]: Start isEmpty. Operand 388 states and 1211 transitions. [2025-04-13 22:16:25,124 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:16:25,124 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:25,125 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:25,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2025-04-13 22:16:25,325 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2025-04-13 22:16:25,325 INFO L403 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:25,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:25,325 INFO L85 PathProgramCache]: Analyzing trace with hash -34751393, now seen corresponding path program 64 times [2025-04-13 22:16:25,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:25,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900559709] [2025-04-13 22:16:25,325 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:16:25,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:25,335 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:16:25,338 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 22:16:25,338 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:16:25,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:25,535 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:25,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:25,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900559709] [2025-04-13 22:16:25,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900559709] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:25,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786508278] [2025-04-13 22:16:25,535 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:16:25,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:25,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:25,537 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:25,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2025-04-13 22:16:25,780 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:16:25,787 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 22:16:25,788 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:16:25,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:25,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 22:16:25,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:25,910 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:16:25,911 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:16:25,934 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:25,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:26,097 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:26,097 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 22:16:26,514 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:26,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786508278] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:26,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:26,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-04-13 22:16:26,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810002045] [2025-04-13 22:16:26,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:26,515 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:16:26,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:26,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:16:26,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:16:26,515 INFO L87 Difference]: Start difference. First operand 388 states and 1211 transitions. Second operand has 21 states, 20 states have (on average 1.75) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:28,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:28,132 INFO L93 Difference]: Finished difference Result 452 states and 1357 transitions. [2025-04-13 22:16:28,132 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:16:28,132 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.75) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:16:28,132 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:28,133 INFO L225 Difference]: With dead ends: 452 [2025-04-13 22:16:28,133 INFO L226 Difference]: Without dead ends: 431 [2025-04-13 22:16:28,134 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=1109, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:16:28,134 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 77 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:28,134 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 0 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:16:28,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-04-13 22:16:28,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 388. [2025-04-13 22:16:28,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 3.124031007751938) internal successors, (1209), 387 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:28,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1209 transitions. [2025-04-13 22:16:28,696 INFO L79 Accepts]: Start accepts. Automaton has 388 states and 1209 transitions. Word has length 28 [2025-04-13 22:16:28,696 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:28,696 INFO L485 AbstractCegarLoop]: Abstraction has 388 states and 1209 transitions. [2025-04-13 22:16:28,697 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.75) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:28,697 INFO L278 IsEmpty]: Start isEmpty. Operand 388 states and 1209 transitions. [2025-04-13 22:16:28,697 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:16:28,697 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:28,697 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:28,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2025-04-13 22:16:28,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:28,898 INFO L403 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:28,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:28,898 INFO L85 PathProgramCache]: Analyzing trace with hash -604770251, now seen corresponding path program 65 times [2025-04-13 22:16:28,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:28,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119644000] [2025-04-13 22:16:28,898 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:16:28,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:28,907 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:16:28,922 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:16:28,923 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:16:28,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:16:29,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:29,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119644000] [2025-04-13 22:16:29,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119644000] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:29,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662638746] [2025-04-13 22:16:29,348 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:16:29,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:29,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:29,350 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:29,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2025-04-13 22:16:29,591 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:16:29,625 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:16:29,626 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:16:29,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:29,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:16:29,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:29,836 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:16:29,837 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 22:16:29,859 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 22:16:29,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:29,978 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:29,978 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 191 [2025-04-13 22:16:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:30,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662638746] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:30,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:30,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 9] total 34 [2025-04-13 22:16:30,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382157446] [2025-04-13 22:16:30,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:30,569 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 22:16:30,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:30,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 22:16:30,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1074, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:16:30,570 INFO L87 Difference]: Start difference. First operand 388 states and 1209 transitions. Second operand has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:32,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:32,832 INFO L93 Difference]: Finished difference Result 536 states and 1531 transitions. [2025-04-13 22:16:32,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 22:16:32,833 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:16:32,833 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:32,834 INFO L225 Difference]: With dead ends: 536 [2025-04-13 22:16:32,834 INFO L226 Difference]: Without dead ends: 507 [2025-04-13 22:16:32,835 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=483, Invalid=4347, Unknown=0, NotChecked=0, Total=4830 [2025-04-13 22:16:32,835 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 206 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 0 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.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:32,835 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 0 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:16:32,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-04-13 22:16:33,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 400. [2025-04-13 22:16:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 3.145363408521303) internal successors, (1255), 399 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1255 transitions. [2025-04-13 22:16:33,447 INFO L79 Accepts]: Start accepts. Automaton has 400 states and 1255 transitions. Word has length 28 [2025-04-13 22:16:33,447 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:33,447 INFO L485 AbstractCegarLoop]: Abstraction has 400 states and 1255 transitions. [2025-04-13 22:16:33,447 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.911764705882353) internal successors, (65), 35 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:33,447 INFO L278 IsEmpty]: Start isEmpty. Operand 400 states and 1255 transitions. [2025-04-13 22:16:33,447 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:16:33,447 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:33,447 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:33,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2025-04-13 22:16:33,648 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:33,648 INFO L403 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:33,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:33,648 INFO L85 PathProgramCache]: Analyzing trace with hash -602262041, now seen corresponding path program 66 times [2025-04-13 22:16:33,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:33,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794649328] [2025-04-13 22:16:33,648 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:16:33,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:33,657 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:16:33,666 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 22:16:33,666 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:16:33,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:33,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:33,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794649328] [2025-04-13 22:16:33,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794649328] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:33,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853476104] [2025-04-13 22:16:33,981 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:16:33,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:33,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:33,982 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:33,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2025-04-13 22:16:34,222 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:16:34,243 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 22:16:34,243 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:16:34,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:34,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:16:34,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:34,477 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:16:34,477 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:16:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:34,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:34,616 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:34,616 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 22:16:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:35,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853476104] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:35,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:35,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 30 [2025-04-13 22:16:35,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965748390] [2025-04-13 22:16:35,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:35,292 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:16:35,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:35,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:16:35,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:16:35,292 INFO L87 Difference]: Start difference. First operand 400 states and 1255 transitions. Second operand has 31 states, 30 states have (on average 1.9) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:37,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:37,732 INFO L93 Difference]: Finished difference Result 563 states and 1593 transitions. [2025-04-13 22:16:37,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 22:16:37,732 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:16:37,732 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:37,734 INFO L225 Difference]: With dead ends: 563 [2025-04-13 22:16:37,734 INFO L226 Difference]: Without dead ends: 535 [2025-04-13 22:16:37,735 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=531, Invalid=4025, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 22:16:37,735 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 209 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:37,735 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 0 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:16:37,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-04-13 22:16:38,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 402. [2025-04-13 22:16:38,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 3.14214463840399) internal successors, (1260), 401 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:38,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1260 transitions. [2025-04-13 22:16:38,374 INFO L79 Accepts]: Start accepts. Automaton has 402 states and 1260 transitions. Word has length 28 [2025-04-13 22:16:38,374 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:38,374 INFO L485 AbstractCegarLoop]: Abstraction has 402 states and 1260 transitions. [2025-04-13 22:16:38,374 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:38,374 INFO L278 IsEmpty]: Start isEmpty. Operand 402 states and 1260 transitions. [2025-04-13 22:16:38,375 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:16:38,375 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:38,375 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:38,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Ended with exit code 0 [2025-04-13 22:16:38,575 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable84 [2025-04-13 22:16:38,576 INFO L403 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:38,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:38,576 INFO L85 PathProgramCache]: Analyzing trace with hash -491439521, now seen corresponding path program 67 times [2025-04-13 22:16:38,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:38,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535504890] [2025-04-13 22:16:38,576 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:16:38,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:38,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:16:38,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:16:38,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:16:38,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:39,074 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:16:39,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:39,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535504890] [2025-04-13 22:16:39,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535504890] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:39,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273979177] [2025-04-13 22:16:39,074 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:16:39,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:39,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:39,076 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:39,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2025-04-13 22:16:39,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:16:39,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:16:39,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:16:39,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:39,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 22:16:39,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:39,544 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:16:39,544 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:16:39,572 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:39,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:39,760 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:39,761 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 230 treesize of output 228 [2025-04-13 22:16:40,365 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:40,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273979177] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:40,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:40,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 33 [2025-04-13 22:16:40,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125743486] [2025-04-13 22:16:40,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:40,365 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:16:40,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:40,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:16:40,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1012, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:16:40,366 INFO L87 Difference]: Start difference. First operand 402 states and 1260 transitions. Second operand has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:43,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:43,082 INFO L93 Difference]: Finished difference Result 530 states and 1552 transitions. [2025-04-13 22:16:43,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 22:16:43,083 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:16:43,083 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:43,084 INFO L225 Difference]: With dead ends: 530 [2025-04-13 22:16:43,084 INFO L226 Difference]: Without dead ends: 500 [2025-04-13 22:16:43,085 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1249 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=588, Invalid=4814, Unknown=0, NotChecked=0, Total=5402 [2025-04-13 22:16:43,085 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 225 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:43,085 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 0 Invalid, 1432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:16:43,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-04-13 22:16:43,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 402. [2025-04-13 22:16:43,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 3.1321695760598502) internal successors, (1256), 401 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1256 transitions. [2025-04-13 22:16:43,705 INFO L79 Accepts]: Start accepts. Automaton has 402 states and 1256 transitions. Word has length 28 [2025-04-13 22:16:43,706 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:43,706 INFO L485 AbstractCegarLoop]: Abstraction has 402 states and 1256 transitions. [2025-04-13 22:16:43,706 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:43,706 INFO L278 IsEmpty]: Start isEmpty. Operand 402 states and 1256 transitions. [2025-04-13 22:16:43,706 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:16:43,706 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:43,706 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:43,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2025-04-13 22:16:43,907 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:43,907 INFO L403 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:43,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:43,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1350908697, now seen corresponding path program 68 times [2025-04-13 22:16:43,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:43,907 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118320334] [2025-04-13 22:16:43,907 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:16:43,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:43,917 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:16:43,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:16:43,927 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:16:43,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:44,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:44,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118320334] [2025-04-13 22:16:44,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118320334] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:44,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476431567] [2025-04-13 22:16:44,333 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:16:44,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:44,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:44,334 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:44,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2025-04-13 22:16:44,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:16:44,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:16:44,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:16:44,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:44,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:16:44,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:44,890 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:16:44,890 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 54 [2025-04-13 22:16:44,916 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:16:44,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:45,085 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:45,086 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 22:16:45,881 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:45,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476431567] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:45,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:45,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 31 [2025-04-13 22:16:45,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230914048] [2025-04-13 22:16:45,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:45,882 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:16:45,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:45,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:16:45,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:16:45,882 INFO L87 Difference]: Start difference. First operand 402 states and 1256 transitions. Second operand has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:47,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:47,783 INFO L93 Difference]: Finished difference Result 490 states and 1458 transitions. [2025-04-13 22:16:47,783 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:16:47,783 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:16:47,783 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:47,785 INFO L225 Difference]: With dead ends: 490 [2025-04-13 22:16:47,785 INFO L226 Difference]: Without dead ends: 466 [2025-04-13 22:16:47,785 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=2269, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:16:47,785 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 129 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:47,785 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 0 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:16:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-04-13 22:16:48,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 402. [2025-04-13 22:16:48,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 3.1271820448877805) internal successors, (1254), 401 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:48,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1254 transitions. [2025-04-13 22:16:48,414 INFO L79 Accepts]: Start accepts. Automaton has 402 states and 1254 transitions. Word has length 28 [2025-04-13 22:16:48,414 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:48,414 INFO L485 AbstractCegarLoop]: Abstraction has 402 states and 1254 transitions. [2025-04-13 22:16:48,414 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.903225806451613) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:48,415 INFO L278 IsEmpty]: Start isEmpty. Operand 402 states and 1254 transitions. [2025-04-13 22:16:48,415 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:16:48,415 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:48,415 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:48,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2025-04-13 22:16:48,615 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:48,616 INFO L403 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:48,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:48,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1369342723, now seen corresponding path program 69 times [2025-04-13 22:16:48,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:48,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197451787] [2025-04-13 22:16:48,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:16:48,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:48,626 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:16:48,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-13 22:16:48,635 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:16:48,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:48,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:48,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197451787] [2025-04-13 22:16:48,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197451787] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:48,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006163498] [2025-04-13 22:16:48,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:16:48,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:48,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:48,997 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:48,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2025-04-13 22:16:49,254 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:16:49,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-13 22:16:49,272 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:16:49,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:49,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:16:49,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:49,565 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:16:49,566 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 42 [2025-04-13 22:16:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:49,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:49,787 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:49,787 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 192 treesize of output 192 [2025-04-13 22:16:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:50,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006163498] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:50,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:50,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 29 [2025-04-13 22:16:50,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973742432] [2025-04-13 22:16:50,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:50,302 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:16:50,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:50,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:16:50,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:16:50,303 INFO L87 Difference]: Start difference. First operand 402 states and 1254 transitions. Second operand has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:52,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:52,352 INFO L93 Difference]: Finished difference Result 496 states and 1473 transitions. [2025-04-13 22:16:52,352 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:16:52,352 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:16:52,352 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:52,354 INFO L225 Difference]: With dead ends: 496 [2025-04-13 22:16:52,354 INFO L226 Difference]: Without dead ends: 470 [2025-04-13 22:16:52,354 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=320, Invalid=2230, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:16:52,354 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 155 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:52,355 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 0 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:16:52,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-04-13 22:16:52,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 396. [2025-04-13 22:16:52,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 3.116455696202532) internal successors, (1231), 395 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:52,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1231 transitions. [2025-04-13 22:16:52,958 INFO L79 Accepts]: Start accepts. Automaton has 396 states and 1231 transitions. Word has length 28 [2025-04-13 22:16:52,958 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:52,958 INFO L485 AbstractCegarLoop]: Abstraction has 396 states and 1231 transitions. [2025-04-13 22:16:52,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:52,958 INFO L278 IsEmpty]: Start isEmpty. Operand 396 states and 1231 transitions. [2025-04-13 22:16:52,959 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:52,959 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:52,959 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:52,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2025-04-13 22:16:53,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:53,159 INFO L403 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:53,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:53,160 INFO L85 PathProgramCache]: Analyzing trace with hash -330822912, now seen corresponding path program 70 times [2025-04-13 22:16:53,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:53,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673754154] [2025-04-13 22:16:53,160 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:16:53,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:53,174 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:16:53,177 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-13 22:16:53,177 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:16:53,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:53,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:53,300 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673754154] [2025-04-13 22:16:53,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673754154] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:53,300 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675601340] [2025-04-13 22:16:53,300 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:16:53,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:53,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:53,302 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:53,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2025-04-13 22:16:53,557 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:16:53,565 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-13 22:16:53,565 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:16:53,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:53,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:16:53,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:53,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:53,727 INFO L325 Elim1Store]: treesize reduction 11, result has 84.9 percent of original size [2025-04-13 22:16:53,727 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 74 [2025-04-13 22:16:53,752 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:53,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675601340] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:53,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:53,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-04-13 22:16:53,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184287198] [2025-04-13 22:16:53,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:53,753 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 22:16:53,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:53,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 22:16:53,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:16:53,753 INFO L87 Difference]: Start difference. First operand 396 states and 1231 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:55,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:55,113 INFO L93 Difference]: Finished difference Result 468 states and 1405 transitions. [2025-04-13 22:16:55,113 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:16:55,113 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:16:55,114 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:55,115 INFO L225 Difference]: With dead ends: 468 [2025-04-13 22:16:55,115 INFO L226 Difference]: Without dead ends: 461 [2025-04-13 22:16:55,115 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:16:55,115 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:55,115 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:16:55,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-04-13 22:16:55,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 396. [2025-04-13 22:16:55,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 3.116455696202532) internal successors, (1231), 395 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:55,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1231 transitions. [2025-04-13 22:16:55,717 INFO L79 Accepts]: Start accepts. Automaton has 396 states and 1231 transitions. Word has length 29 [2025-04-13 22:16:55,717 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:55,717 INFO L485 AbstractCegarLoop]: Abstraction has 396 states and 1231 transitions. [2025-04-13 22:16:55,717 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:55,717 INFO L278 IsEmpty]: Start isEmpty. Operand 396 states and 1231 transitions. [2025-04-13 22:16:55,717 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:55,717 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:55,717 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:55,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2025-04-13 22:16:55,918 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2025-04-13 22:16:55,918 INFO L403 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:55,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:55,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1023882642, now seen corresponding path program 71 times [2025-04-13 22:16:55,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:55,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527715149] [2025-04-13 22:16:55,918 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:16:55,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:55,928 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:55,940 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:55,940 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:16:55,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:16:56,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:56,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527715149] [2025-04-13 22:16:56,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527715149] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:56,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609450506] [2025-04-13 22:16:56,272 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:16:56,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:56,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:56,274 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:56,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2025-04-13 22:16:56,563 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:56,653 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:56,653 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:16:56,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:56,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:16:56,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:16:56,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:56,906 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:16:56,906 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 83 [2025-04-13 22:16:56,940 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:56,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609450506] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:56,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:56,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 25 [2025-04-13 22:16:56,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976794958] [2025-04-13 22:16:56,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:56,941 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:16:56,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:56,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:16:56,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:16:56,941 INFO L87 Difference]: Start difference. First operand 396 states and 1231 transitions. Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:58,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:58,450 INFO L93 Difference]: Finished difference Result 468 states and 1405 transitions. [2025-04-13 22:16:58,450 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:16:58,450 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:16:58,450 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:58,452 INFO L225 Difference]: With dead ends: 468 [2025-04-13 22:16:58,452 INFO L226 Difference]: Without dead ends: 461 [2025-04-13 22:16:58,453 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:16:58,453 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:58,453 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:16:58,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-04-13 22:16:59,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 396. [2025-04-13 22:16:59,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 3.116455696202532) internal successors, (1231), 395 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:59,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1231 transitions. [2025-04-13 22:16:59,078 INFO L79 Accepts]: Start accepts. Automaton has 396 states and 1231 transitions. Word has length 29 [2025-04-13 22:16:59,078 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:59,078 INFO L485 AbstractCegarLoop]: Abstraction has 396 states and 1231 transitions. [2025-04-13 22:16:59,078 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:59,078 INFO L278 IsEmpty]: Start isEmpty. Operand 396 states and 1231 transitions. [2025-04-13 22:16:59,078 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:59,078 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:59,079 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:59,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Ended with exit code 0 [2025-04-13 22:16:59,279 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2025-04-13 22:16:59,279 INFO L403 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:59,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:59,279 INFO L85 PathProgramCache]: Analyzing trace with hash -848035388, now seen corresponding path program 72 times [2025-04-13 22:16:59,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:59,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389847425] [2025-04-13 22:16:59,280 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:16:59,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:59,289 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:59,305 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:59,306 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:16:59,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:59,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:59,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389847425] [2025-04-13 22:16:59,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389847425] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:59,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315880790] [2025-04-13 22:16:59,587 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:16:59,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:59,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:59,589 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:59,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2025-04-13 22:16:59,853 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:59,916 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:59,916 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:16:59,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:59,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:16:59,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:00,012 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:00,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:00,079 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:17:00,079 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 22:17:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:00,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315880790] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:00,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:00,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 22 [2025-04-13 22:17:00,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103135284] [2025-04-13 22:17:00,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:00,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:17:00,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:00,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:17:00,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:17:00,165 INFO L87 Difference]: Start difference. First operand 396 states and 1231 transitions. Second operand has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:02,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:02,390 INFO L93 Difference]: Finished difference Result 581 states and 1656 transitions. [2025-04-13 22:17:02,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:17:02,391 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:17:02,391 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:02,392 INFO L225 Difference]: With dead ends: 581 [2025-04-13 22:17:02,392 INFO L226 Difference]: Without dead ends: 574 [2025-04-13 22:17:02,393 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=1074, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:17:02,393 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:02,393 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 0 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:17:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-04-13 22:17:03,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 410. [2025-04-13 22:17:03,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 3.12958435207824) internal successors, (1280), 409 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:03,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1280 transitions. [2025-04-13 22:17:03,067 INFO L79 Accepts]: Start accepts. Automaton has 410 states and 1280 transitions. Word has length 29 [2025-04-13 22:17:03,067 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:03,067 INFO L485 AbstractCegarLoop]: Abstraction has 410 states and 1280 transitions. [2025-04-13 22:17:03,067 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:03,067 INFO L278 IsEmpty]: Start isEmpty. Operand 410 states and 1280 transitions. [2025-04-13 22:17:03,068 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:03,068 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:03,068 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:03,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Ended with exit code 0 [2025-04-13 22:17:03,268 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:03,268 INFO L403 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:03,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:03,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1822975550, now seen corresponding path program 73 times [2025-04-13 22:17:03,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:03,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126394006] [2025-04-13 22:17:03,269 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:17:03,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:03,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:17:03,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:03,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:03,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:03,744 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:17:03,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:03,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126394006] [2025-04-13 22:17:03,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126394006] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:03,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771008672] [2025-04-13 22:17:03,744 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:17:03,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:03,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:03,746 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:03,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2025-04-13 22:17:04,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:17:04,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:04,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:04,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:04,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:17:04,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:04,142 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:04,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:04,268 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:17:04,268 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 87 [2025-04-13 22:17:04,326 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:04,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771008672] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:04,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:04,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2025-04-13 22:17:04,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141998770] [2025-04-13 22:17:04,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:04,327 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:17:04,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:04,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:17:04,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:17:04,327 INFO L87 Difference]: Start difference. First operand 410 states and 1280 transitions. Second operand has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:06,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:06,260 INFO L93 Difference]: Finished difference Result 473 states and 1440 transitions. [2025-04-13 22:17:06,260 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:17:06,260 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:17:06,260 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:06,262 INFO L225 Difference]: With dead ends: 473 [2025-04-13 22:17:06,262 INFO L226 Difference]: Without dead ends: 466 [2025-04-13 22:17:06,262 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=1928, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:17:06,262 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:06,262 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:17:06,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-04-13 22:17:06,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 410. [2025-04-13 22:17:06,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 3.12958435207824) internal successors, (1280), 409 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:06,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1280 transitions. [2025-04-13 22:17:06,922 INFO L79 Accepts]: Start accepts. Automaton has 410 states and 1280 transitions. Word has length 29 [2025-04-13 22:17:06,922 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:06,922 INFO L485 AbstractCegarLoop]: Abstraction has 410 states and 1280 transitions. [2025-04-13 22:17:06,922 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:06,922 INFO L278 IsEmpty]: Start isEmpty. Operand 410 states and 1280 transitions. [2025-04-13 22:17:06,923 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:06,923 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:06,923 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:06,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Ended with exit code 0 [2025-04-13 22:17:07,123 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable91 [2025-04-13 22:17:07,123 INFO L403 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:07,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:07,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2075578189, now seen corresponding path program 74 times [2025-04-13 22:17:07,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:07,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132607232] [2025-04-13 22:17:07,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:07,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:07,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:07,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:07,146 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:17:07,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:07,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:07,418 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132607232] [2025-04-13 22:17:07,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132607232] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:07,418 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541282074] [2025-04-13 22:17:07,418 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:07,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:07,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:07,420 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:07,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2025-04-13 22:17:07,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:07,715 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:07,715 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:17:07,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:07,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 22:17:07,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:07,855 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:17:07,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:07,997 INFO L325 Elim1Store]: treesize reduction 22, result has 87.4 percent of original size [2025-04-13 22:17:07,997 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 70 treesize of output 171 [2025-04-13 22:17:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:08,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541282074] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:08,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:08,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 25 [2025-04-13 22:17:08,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51349766] [2025-04-13 22:17:08,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:08,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:17:08,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:08,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:17:08,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:17:08,237 INFO L87 Difference]: Start difference. First operand 410 states and 1280 transitions. Second operand has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:10,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:10,109 INFO L93 Difference]: Finished difference Result 528 states and 1526 transitions. [2025-04-13 22:17:10,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:17:10,109 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:17:10,109 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:10,111 INFO L225 Difference]: With dead ends: 528 [2025-04-13 22:17:10,111 INFO L226 Difference]: Without dead ends: 511 [2025-04-13 22:17:10,111 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=1301, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:17:10,112 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 117 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:10,112 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 0 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:17:10,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-04-13 22:17:10,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 423. [2025-04-13 22:17:10,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 3.123222748815166) internal successors, (1318), 422 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1318 transitions. [2025-04-13 22:17:10,811 INFO L79 Accepts]: Start accepts. Automaton has 423 states and 1318 transitions. Word has length 29 [2025-04-13 22:17:10,811 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:10,811 INFO L485 AbstractCegarLoop]: Abstraction has 423 states and 1318 transitions. [2025-04-13 22:17:10,811 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:10,811 INFO L278 IsEmpty]: Start isEmpty. Operand 423 states and 1318 transitions. [2025-04-13 22:17:10,811 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:10,812 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:10,812 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:10,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2025-04-13 22:17:11,012 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:11,012 INFO L403 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:11,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:11,012 INFO L85 PathProgramCache]: Analyzing trace with hash 456117680, now seen corresponding path program 75 times [2025-04-13 22:17:11,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:11,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9188903] [2025-04-13 22:17:11,012 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:17:11,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:11,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:11,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 22:17:11,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:17:11,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:11,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:11,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9188903] [2025-04-13 22:17:11,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9188903] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:11,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537505689] [2025-04-13 22:17:11,375 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:17:11,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:11,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:11,377 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:11,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2025-04-13 22:17:11,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:11,671 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 22:17:11,671 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:17:11,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:11,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:17:11,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:11,810 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:11,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:11,875 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:17:11,875 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 22:17:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:11,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537505689] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:11,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:11,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 29 [2025-04-13 22:17:11,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825016094] [2025-04-13 22:17:11,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:11,964 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:17:11,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:11,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:17:11,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:17:11,964 INFO L87 Difference]: Start difference. First operand 423 states and 1318 transitions. Second operand has 29 states, 29 states have (on average 1.896551724137931) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:14,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:14,045 INFO L93 Difference]: Finished difference Result 550 states and 1592 transitions. [2025-04-13 22:17:14,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:17:14,045 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.896551724137931) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:17:14,045 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:14,047 INFO L225 Difference]: With dead ends: 550 [2025-04-13 22:17:14,047 INFO L226 Difference]: Without dead ends: 543 [2025-04-13 22:17:14,047 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=296, Invalid=1866, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:17:14,047 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 120 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:14,047 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 0 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:17:14,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-04-13 22:17:14,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 425. [2025-04-13 22:17:14,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 3.1202830188679247) internal successors, (1323), 424 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:14,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1323 transitions. [2025-04-13 22:17:14,712 INFO L79 Accepts]: Start accepts. Automaton has 425 states and 1323 transitions. Word has length 29 [2025-04-13 22:17:14,712 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:14,712 INFO L485 AbstractCegarLoop]: Abstraction has 425 states and 1323 transitions. [2025-04-13 22:17:14,712 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.896551724137931) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:14,712 INFO L278 IsEmpty]: Start isEmpty. Operand 425 states and 1323 transitions. [2025-04-13 22:17:14,713 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:14,713 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:14,713 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:14,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2025-04-13 22:17:14,913 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:14,914 INFO L403 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:14,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:14,914 INFO L85 PathProgramCache]: Analyzing trace with hash 619814238, now seen corresponding path program 76 times [2025-04-13 22:17:14,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:14,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787354540] [2025-04-13 22:17:14,914 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:17:14,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:14,925 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:14,928 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-13 22:17:14,928 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:17:14,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:15,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:15,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787354540] [2025-04-13 22:17:15,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787354540] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:15,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039881245] [2025-04-13 22:17:15,049 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:17:15,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:15,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:15,051 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:15,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2025-04-13 22:17:15,332 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:15,340 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-13 22:17:15,340 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:17:15,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:15,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:17:15,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:15,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:15,512 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:17:15,513 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 87 [2025-04-13 22:17:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:15,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039881245] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:15,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:15,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 22:17:15,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622902946] [2025-04-13 22:17:15,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:15,596 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:17:15,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:15,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:17:15,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:17:15,596 INFO L87 Difference]: Start difference. First operand 425 states and 1323 transitions. Second operand has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:17,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:17,408 INFO L93 Difference]: Finished difference Result 531 states and 1591 transitions. [2025-04-13 22:17:17,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:17:17,408 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:17:17,408 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:17,410 INFO L225 Difference]: With dead ends: 531 [2025-04-13 22:17:17,410 INFO L226 Difference]: Without dead ends: 524 [2025-04-13 22:17:17,410 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=1003, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:17:17,410 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:17,410 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:17:17,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-04-13 22:17:18,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 431. [2025-04-13 22:17:18,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 430 states have (on average 3.116279069767442) internal successors, (1340), 430 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1340 transitions. [2025-04-13 22:17:18,086 INFO L79 Accepts]: Start accepts. Automaton has 431 states and 1340 transitions. Word has length 29 [2025-04-13 22:17:18,086 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:18,086 INFO L485 AbstractCegarLoop]: Abstraction has 431 states and 1340 transitions. [2025-04-13 22:17:18,086 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:18,086 INFO L278 IsEmpty]: Start isEmpty. Operand 431 states and 1340 transitions. [2025-04-13 22:17:18,087 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:18,087 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:18,087 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:18,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Ended with exit code 0 [2025-04-13 22:17:18,287 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:18,287 INFO L403 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:18,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:18,288 INFO L85 PathProgramCache]: Analyzing trace with hash -302344171, now seen corresponding path program 77 times [2025-04-13 22:17:18,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:18,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258214339] [2025-04-13 22:17:18,288 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:17:18,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:18,298 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:18,312 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:18,312 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:17:18,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:18,613 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:17:18,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:18,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258214339] [2025-04-13 22:17:18,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258214339] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:18,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975000857] [2025-04-13 22:17:18,613 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:17:18,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:18,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:18,615 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:18,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2025-04-13 22:17:18,894 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:18,970 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:18,970 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:17:18,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:18,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:17:18,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:19,102 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:17:19,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:19,153 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:17:19,154 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 130 [2025-04-13 22:17:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:19,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975000857] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:19,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:19,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 25 [2025-04-13 22:17:19,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974517097] [2025-04-13 22:17:19,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:19,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:17:19,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:19,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:17:19,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:17:19,261 INFO L87 Difference]: Start difference. First operand 431 states and 1340 transitions. Second operand has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:20,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:20,830 INFO L93 Difference]: Finished difference Result 484 states and 1428 transitions. [2025-04-13 22:17:20,830 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:17:20,830 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:17:20,830 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:20,832 INFO L225 Difference]: With dead ends: 484 [2025-04-13 22:17:20,832 INFO L226 Difference]: Without dead ends: 470 [2025-04-13 22:17:20,832 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=194, Invalid=1366, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:17:20,832 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 72 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:20,832 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 0 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:17:20,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-04-13 22:17:21,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 434. [2025-04-13 22:17:21,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 3.1016166281755195) internal successors, (1343), 433 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1343 transitions. [2025-04-13 22:17:21,528 INFO L79 Accepts]: Start accepts. Automaton has 434 states and 1343 transitions. Word has length 29 [2025-04-13 22:17:21,528 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:21,528 INFO L485 AbstractCegarLoop]: Abstraction has 434 states and 1343 transitions. [2025-04-13 22:17:21,528 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:21,528 INFO L278 IsEmpty]: Start isEmpty. Operand 434 states and 1343 transitions. [2025-04-13 22:17:21,528 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:21,528 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:21,528 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:21,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Ended with exit code 0 [2025-04-13 22:17:21,729 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:21,729 INFO L403 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:21,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:21,729 INFO L85 PathProgramCache]: Analyzing trace with hash -903189986, now seen corresponding path program 78 times [2025-04-13 22:17:21,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:21,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588593758] [2025-04-13 22:17:21,729 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:17:21,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:21,739 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:21,756 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:21,756 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:17:21,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:22,059 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:22,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:22,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588593758] [2025-04-13 22:17:22,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588593758] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:22,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519651266] [2025-04-13 22:17:22,060 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:17:22,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:22,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:22,061 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:22,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2025-04-13 22:17:22,343 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:22,373 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:22,374 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:17:22,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:22,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:17:22,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:22,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:22,627 INFO L325 Elim1Store]: treesize reduction 30, result has 82.8 percent of original size [2025-04-13 22:17:22,628 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 70 treesize of output 163 [2025-04-13 22:17:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:22,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519651266] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:22,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:22,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 23 [2025-04-13 22:17:22,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961217205] [2025-04-13 22:17:22,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:22,773 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:17:22,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:22,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:17:22,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:17:22,774 INFO L87 Difference]: Start difference. First operand 434 states and 1343 transitions. Second operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:24,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:24,987 INFO L93 Difference]: Finished difference Result 588 states and 1682 transitions. [2025-04-13 22:17:24,987 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:17:24,987 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:17:24,987 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:24,989 INFO L225 Difference]: With dead ends: 588 [2025-04-13 22:17:24,989 INFO L226 Difference]: Without dead ends: 581 [2025-04-13 22:17:24,989 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=1414, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:17:24,989 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:24,989 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:17:24,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-04-13 22:17:25,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 444. [2025-04-13 22:17:25,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 3.106094808126411) internal successors, (1376), 443 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1376 transitions. [2025-04-13 22:17:25,741 INFO L79 Accepts]: Start accepts. Automaton has 444 states and 1376 transitions. Word has length 29 [2025-04-13 22:17:25,741 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:25,741 INFO L485 AbstractCegarLoop]: Abstraction has 444 states and 1376 transitions. [2025-04-13 22:17:25,741 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:25,741 INFO L278 IsEmpty]: Start isEmpty. Operand 444 states and 1376 transitions. [2025-04-13 22:17:25,742 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:25,742 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:25,742 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:25,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Ended with exit code 0 [2025-04-13 22:17:25,942 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:25,942 INFO L403 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:25,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:25,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1835919484, now seen corresponding path program 79 times [2025-04-13 22:17:25,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:25,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271735420] [2025-04-13 22:17:25,943 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:17:25,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:25,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:17:25,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:25,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:25,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:26,426 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:17:26,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:26,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271735420] [2025-04-13 22:17:26,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271735420] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:26,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150010553] [2025-04-13 22:17:26,426 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:17:26,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:26,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:26,428 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:26,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2025-04-13 22:17:26,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:17:26,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:26,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:26,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:26,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 22:17:26,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:26,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:26,878 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:17:26,878 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 124 [2025-04-13 22:17:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:27,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150010553] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:27,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:27,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 30 [2025-04-13 22:17:27,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891915632] [2025-04-13 22:17:27,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:27,008 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:17:27,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:27,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:17:27,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:17:27,009 INFO L87 Difference]: Start difference. First operand 444 states and 1376 transitions. Second operand has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:28,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:28,797 INFO L93 Difference]: Finished difference Result 502 states and 1484 transitions. [2025-04-13 22:17:28,798 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:17:28,798 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:17:28,798 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:28,799 INFO L225 Difference]: With dead ends: 502 [2025-04-13 22:17:28,799 INFO L226 Difference]: Without dead ends: 489 [2025-04-13 22:17:28,800 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=285, Invalid=2067, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:17:28,800 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:28,800 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:17:28,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-04-13 22:17:29,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 450. [2025-04-13 22:17:29,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 3.0979955456570156) internal successors, (1391), 449 states have internal predecessors, (1391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:29,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1391 transitions. [2025-04-13 22:17:29,517 INFO L79 Accepts]: Start accepts. Automaton has 450 states and 1391 transitions. Word has length 29 [2025-04-13 22:17:29,517 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:29,517 INFO L485 AbstractCegarLoop]: Abstraction has 450 states and 1391 transitions. [2025-04-13 22:17:29,517 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:29,517 INFO L278 IsEmpty]: Start isEmpty. Operand 450 states and 1391 transitions. [2025-04-13 22:17:29,518 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:29,518 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:29,518 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:29,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Ended with exit code 0 [2025-04-13 22:17:29,718 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable97 [2025-04-13 22:17:29,718 INFO L403 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:29,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:29,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2064810172, now seen corresponding path program 80 times [2025-04-13 22:17:29,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:29,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938728513] [2025-04-13 22:17:29,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:29,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:29,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:29,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:29,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:17:29,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:30,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:30,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938728513] [2025-04-13 22:17:30,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938728513] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:30,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785977158] [2025-04-13 22:17:30,034 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:30,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:30,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:30,036 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:30,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2025-04-13 22:17:30,363 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:30,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:30,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:17:30,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:30,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:17:30,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:17:30,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:30,569 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:17:30,570 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 22:17:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:30,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785977158] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:30,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:30,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 24 [2025-04-13 22:17:30,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943426693] [2025-04-13 22:17:30,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:30,662 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:17:30,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:30,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:17:30,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:17:30,663 INFO L87 Difference]: Start difference. First operand 450 states and 1391 transitions. Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:32,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:32,347 INFO L93 Difference]: Finished difference Result 526 states and 1554 transitions. [2025-04-13 22:17:32,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:17:32,347 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:17:32,347 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:32,349 INFO L225 Difference]: With dead ends: 526 [2025-04-13 22:17:32,349 INFO L226 Difference]: Without dead ends: 519 [2025-04-13 22:17:32,349 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:17:32,349 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:32,349 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:17:32,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-04-13 22:17:33,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 446. [2025-04-13 22:17:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 3.0853932584269663) internal successors, (1373), 445 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1373 transitions. [2025-04-13 22:17:33,060 INFO L79 Accepts]: Start accepts. Automaton has 446 states and 1373 transitions. Word has length 29 [2025-04-13 22:17:33,060 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:33,060 INFO L485 AbstractCegarLoop]: Abstraction has 446 states and 1373 transitions. [2025-04-13 22:17:33,060 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:33,060 INFO L278 IsEmpty]: Start isEmpty. Operand 446 states and 1373 transitions. [2025-04-13 22:17:33,062 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:33,062 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:33,062 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:33,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Ended with exit code 0 [2025-04-13 22:17:33,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2025-04-13 22:17:33,262 INFO L403 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:33,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:33,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1245583260, now seen corresponding path program 81 times [2025-04-13 22:17:33,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:33,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427695499] [2025-04-13 22:17:33,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:17:33,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:33,274 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:33,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 22:17:33,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:17:33,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:33,564 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:33,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:33,564 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427695499] [2025-04-13 22:17:33,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427695499] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:33,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381707530] [2025-04-13 22:17:33,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:17:33,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:33,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:33,566 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:33,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2025-04-13 22:17:33,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:33,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 22:17:33,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:17:33,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:33,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:17:33,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:33,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:34,062 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:17:34,063 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 87 [2025-04-13 22:17:34,127 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:34,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381707530] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:34,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:34,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 21 [2025-04-13 22:17:34,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608292639] [2025-04-13 22:17:34,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:34,127 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:17:34,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:34,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:17:34,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:17:34,128 INFO L87 Difference]: Start difference. First operand 446 states and 1373 transitions. Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:35,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:35,795 INFO L93 Difference]: Finished difference Result 517 states and 1549 transitions. [2025-04-13 22:17:35,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:17:35,795 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:17:35,795 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:35,796 INFO L225 Difference]: With dead ends: 517 [2025-04-13 22:17:35,797 INFO L226 Difference]: Without dead ends: 510 [2025-04-13 22:17:35,797 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:17:35,797 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:35,797 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:17:35,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-04-13 22:17:36,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 439. [2025-04-13 22:17:36,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 3.08675799086758) internal successors, (1352), 438 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:36,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1352 transitions. [2025-04-13 22:17:36,544 INFO L79 Accepts]: Start accepts. Automaton has 439 states and 1352 transitions. Word has length 29 [2025-04-13 22:17:36,544 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:36,544 INFO L485 AbstractCegarLoop]: Abstraction has 439 states and 1352 transitions. [2025-04-13 22:17:36,544 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:36,544 INFO L278 IsEmpty]: Start isEmpty. Operand 439 states and 1352 transitions. [2025-04-13 22:17:36,545 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:36,545 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:36,545 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:36,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Ended with exit code 0 [2025-04-13 22:17:36,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99 [2025-04-13 22:17:36,745 INFO L403 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:36,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:36,745 INFO L85 PathProgramCache]: Analyzing trace with hash -2115920327, now seen corresponding path program 82 times [2025-04-13 22:17:36,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:36,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187992622] [2025-04-13 22:17:36,746 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:17:36,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:36,756 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:36,759 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-13 22:17:36,760 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:17:36,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:36,880 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:36,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:36,880 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187992622] [2025-04-13 22:17:36,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187992622] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:36,880 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137771977] [2025-04-13 22:17:36,880 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:17:36,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:36,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:36,884 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:36,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2025-04-13 22:17:37,177 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:37,185 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-13 22:17:37,185 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:17:37,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:37,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 22:17:37,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:37,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:37,392 INFO L325 Elim1Store]: treesize reduction 22, result has 87.4 percent of original size [2025-04-13 22:17:37,392 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 70 treesize of output 171 [2025-04-13 22:17:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:37,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137771977] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:37,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:37,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-04-13 22:17:37,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700478449] [2025-04-13 22:17:37,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:37,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:17:37,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:37,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:17:37,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:17:37,581 INFO L87 Difference]: Start difference. First operand 439 states and 1352 transitions. Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 20 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:39,262 INFO L93 Difference]: Finished difference Result 551 states and 1547 transitions. [2025-04-13 22:17:39,262 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:17:39,262 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 20 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:17:39,262 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:39,264 INFO L225 Difference]: With dead ends: 551 [2025-04-13 22:17:39,264 INFO L226 Difference]: Without dead ends: 537 [2025-04-13 22:17:39,264 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=674, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:17:39,265 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 99 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:39,265 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 0 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:17:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-04-13 22:17:40,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 444. [2025-04-13 22:17:40,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 3.0857787810383748) internal successors, (1367), 443 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1367 transitions. [2025-04-13 22:17:40,011 INFO L79 Accepts]: Start accepts. Automaton has 444 states and 1367 transitions. Word has length 29 [2025-04-13 22:17:40,011 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:40,011 INFO L485 AbstractCegarLoop]: Abstraction has 444 states and 1367 transitions. [2025-04-13 22:17:40,011 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 20 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:40,011 INFO L278 IsEmpty]: Start isEmpty. Operand 444 states and 1367 transitions. [2025-04-13 22:17:40,012 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:40,012 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:40,012 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:40,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Ended with exit code 0 [2025-04-13 22:17:40,212 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2025-04-13 22:17:40,212 INFO L403 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:40,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:40,213 INFO L85 PathProgramCache]: Analyzing trace with hash -628842980, now seen corresponding path program 83 times [2025-04-13 22:17:40,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:40,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181404504] [2025-04-13 22:17:40,213 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:17:40,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:40,223 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:40,238 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:40,238 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:17:40,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:40,579 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:17:40,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:40,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181404504] [2025-04-13 22:17:40,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181404504] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:40,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420622578] [2025-04-13 22:17:40,579 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:17:40,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:40,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:40,581 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:40,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2025-04-13 22:17:40,879 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:40,926 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:40,926 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:17:40,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:40,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:17:40,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:41,067 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:17:41,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:41,144 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:17:41,144 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 22:17:41,233 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:41,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420622578] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:41,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:41,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 27 [2025-04-13 22:17:41,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533508793] [2025-04-13 22:17:41,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:41,233 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:17:41,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:41,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:17:41,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:17:41,234 INFO L87 Difference]: Start difference. First operand 444 states and 1367 transitions. Second operand has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:43,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:43,207 INFO L93 Difference]: Finished difference Result 539 states and 1565 transitions. [2025-04-13 22:17:43,207 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:17:43,207 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:17:43,207 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:43,209 INFO L225 Difference]: With dead ends: 539 [2025-04-13 22:17:43,209 INFO L226 Difference]: Without dead ends: 530 [2025-04-13 22:17:43,209 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=240, Invalid=1740, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:17:43,210 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:43,210 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:17:43,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-04-13 22:17:43,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 442. [2025-04-13 22:17:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 3.070294784580499) internal successors, (1354), 441 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:43,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1354 transitions. [2025-04-13 22:17:43,915 INFO L79 Accepts]: Start accepts. Automaton has 442 states and 1354 transitions. Word has length 29 [2025-04-13 22:17:43,915 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:43,915 INFO L485 AbstractCegarLoop]: Abstraction has 442 states and 1354 transitions. [2025-04-13 22:17:43,915 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:43,915 INFO L278 IsEmpty]: Start isEmpty. Operand 442 states and 1354 transitions. [2025-04-13 22:17:43,915 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:43,915 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:43,915 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:43,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Ended with exit code 0 [2025-04-13 22:17:44,116 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:44,116 INFO L403 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:44,116 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:44,116 INFO L85 PathProgramCache]: Analyzing trace with hash -542955527, now seen corresponding path program 84 times [2025-04-13 22:17:44,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:44,116 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437460482] [2025-04-13 22:17:44,116 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:17:44,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:44,126 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:44,145 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:44,146 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:17:44,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:44,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:44,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437460482] [2025-04-13 22:17:44,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437460482] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:44,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894754031] [2025-04-13 22:17:44,447 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:17:44,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:44,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:44,448 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:44,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2025-04-13 22:17:44,741 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:44,768 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:44,768 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:17:44,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:44,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:17:44,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:44,869 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:17:44,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:44,932 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:17:44,932 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 22:17:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:45,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894754031] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:45,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:45,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 24 [2025-04-13 22:17:45,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583212724] [2025-04-13 22:17:45,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:45,012 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:17:45,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:45,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:17:45,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:17:45,012 INFO L87 Difference]: Start difference. First operand 442 states and 1354 transitions. Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:46,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:46,729 INFO L93 Difference]: Finished difference Result 541 states and 1560 transitions. [2025-04-13 22:17:46,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:17:46,730 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:17:46,730 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:46,731 INFO L225 Difference]: With dead ends: 541 [2025-04-13 22:17:46,731 INFO L226 Difference]: Without dead ends: 527 [2025-04-13 22:17:46,731 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:17:46,731 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:46,732 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:17:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-04-13 22:17:47,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 442. [2025-04-13 22:17:47,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 3.0657596371882088) internal successors, (1352), 441 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:47,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1352 transitions. [2025-04-13 22:17:47,441 INFO L79 Accepts]: Start accepts. Automaton has 442 states and 1352 transitions. Word has length 29 [2025-04-13 22:17:47,441 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:47,441 INFO L485 AbstractCegarLoop]: Abstraction has 442 states and 1352 transitions. [2025-04-13 22:17:47,441 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:47,441 INFO L278 IsEmpty]: Start isEmpty. Operand 442 states and 1352 transitions. [2025-04-13 22:17:47,441 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:47,441 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:47,441 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:47,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Ended with exit code 0 [2025-04-13 22:17:47,642 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2025-04-13 22:17:47,642 INFO L403 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:47,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:47,642 INFO L85 PathProgramCache]: Analyzing trace with hash -123782820, now seen corresponding path program 85 times [2025-04-13 22:17:47,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:47,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846010503] [2025-04-13 22:17:47,642 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:17:47,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:47,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:17:47,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:47,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:47,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:48,082 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:17:48,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:48,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846010503] [2025-04-13 22:17:48,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846010503] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:48,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967507084] [2025-04-13 22:17:48,083 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:17:48,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:48,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:48,084 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:48,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2025-04-13 22:17:48,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:17:48,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:48,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:48,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:48,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:17:48,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:48,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:48,573 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:17:48,573 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 22:17:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:48,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967507084] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:48,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:48,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 30 [2025-04-13 22:17:48,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53529060] [2025-04-13 22:17:48,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:48,664 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:17:48,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:48,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:17:48,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:17:48,665 INFO L87 Difference]: Start difference. First operand 442 states and 1352 transitions. Second operand has 30 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:50,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:50,513 INFO L93 Difference]: Finished difference Result 534 states and 1569 transitions. [2025-04-13 22:17:50,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:17:50,513 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:17:50,514 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:50,515 INFO L225 Difference]: With dead ends: 534 [2025-04-13 22:17:50,515 INFO L226 Difference]: Without dead ends: 527 [2025-04-13 22:17:50,516 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=281, Invalid=2071, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:17:50,516 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:50,516 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:17:50,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-04-13 22:17:51,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 450. [2025-04-13 22:17:51,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 3.0645879732739423) internal successors, (1376), 449 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:51,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1376 transitions. [2025-04-13 22:17:51,238 INFO L79 Accepts]: Start accepts. Automaton has 450 states and 1376 transitions. Word has length 29 [2025-04-13 22:17:51,238 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:51,238 INFO L485 AbstractCegarLoop]: Abstraction has 450 states and 1376 transitions. [2025-04-13 22:17:51,238 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:51,238 INFO L278 IsEmpty]: Start isEmpty. Operand 450 states and 1376 transitions. [2025-04-13 22:17:51,239 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:51,239 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:51,239 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:51,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Forceful destruction successful, exit code 0 [2025-04-13 22:17:51,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2025-04-13 22:17:51,439 INFO L403 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:51,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:51,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1756239073, now seen corresponding path program 86 times [2025-04-13 22:17:51,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:51,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447556639] [2025-04-13 22:17:51,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:51,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:51,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:51,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:51,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:17:51,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:51,789 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:51,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:51,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447556639] [2025-04-13 22:17:51,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447556639] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:51,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790313310] [2025-04-13 22:17:51,789 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:51,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:51,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:51,791 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:51,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2025-04-13 22:17:52,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:52,112 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:52,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:17:52,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:52,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:17:52,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:52,286 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:17:52,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:52,365 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:17:52,365 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 87 [2025-04-13 22:17:52,450 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:52,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790313310] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:52,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:52,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 31 [2025-04-13 22:17:52,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593799636] [2025-04-13 22:17:52,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:52,450 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:17:52,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:52,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:17:52,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:17:52,451 INFO L87 Difference]: Start difference. First operand 450 states and 1376 transitions. Second operand has 31 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:54,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:54,619 INFO L93 Difference]: Finished difference Result 551 states and 1611 transitions. [2025-04-13 22:17:54,620 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:17:54,620 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:17:54,620 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:54,622 INFO L225 Difference]: With dead ends: 551 [2025-04-13 22:17:54,622 INFO L226 Difference]: Without dead ends: 543 [2025-04-13 22:17:54,622 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=311, Invalid=2341, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:17:54,622 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 128 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:54,622 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 0 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:17:54,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-04-13 22:17:55,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 452. [2025-04-13 22:17:55,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 3.066518847006652) internal successors, (1383), 451 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:55,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1383 transitions. [2025-04-13 22:17:55,377 INFO L79 Accepts]: Start accepts. Automaton has 452 states and 1383 transitions. Word has length 29 [2025-04-13 22:17:55,377 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:55,377 INFO L485 AbstractCegarLoop]: Abstraction has 452 states and 1383 transitions. [2025-04-13 22:17:55,377 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:55,377 INFO L278 IsEmpty]: Start isEmpty. Operand 452 states and 1383 transitions. [2025-04-13 22:17:55,377 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:55,377 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:55,377 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:55,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Ended with exit code 0 [2025-04-13 22:17:55,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable104 [2025-04-13 22:17:55,578 INFO L403 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:55,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:55,578 INFO L85 PathProgramCache]: Analyzing trace with hash -482658648, now seen corresponding path program 87 times [2025-04-13 22:17:55,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:55,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621478362] [2025-04-13 22:17:55,578 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:17:55,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:55,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:55,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 22:17:55,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:17:55,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:55,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:55,884 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621478362] [2025-04-13 22:17:55,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621478362] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:55,884 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885163785] [2025-04-13 22:17:55,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:17:55,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:55,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:55,886 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:55,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2025-04-13 22:17:56,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:56,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 22:17:56,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:17:56,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:56,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 22:17:56,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:56,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:56,557 INFO L325 Elim1Store]: treesize reduction 32, result has 81.6 percent of original size [2025-04-13 22:17:56,557 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 72 treesize of output 161 [2025-04-13 22:17:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:56,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885163785] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:56,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:56,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 24 [2025-04-13 22:17:56,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808347579] [2025-04-13 22:17:56,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:56,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:17:56,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:56,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:17:56,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:17:56,668 INFO L87 Difference]: Start difference. First operand 452 states and 1383 transitions. Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:58,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:58,721 INFO L93 Difference]: Finished difference Result 564 states and 1639 transitions. [2025-04-13 22:17:58,722 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:17:58,722 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:17:58,722 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:58,723 INFO L225 Difference]: With dead ends: 564 [2025-04-13 22:17:58,723 INFO L226 Difference]: Without dead ends: 557 [2025-04-13 22:17:58,723 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=1101, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:17:58,724 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:58,724 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:17:58,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-04-13 22:17:59,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 456. [2025-04-13 22:17:59,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 3.0703296703296705) internal successors, (1397), 455 states have internal predecessors, (1397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1397 transitions. [2025-04-13 22:17:59,496 INFO L79 Accepts]: Start accepts. Automaton has 456 states and 1397 transitions. Word has length 29 [2025-04-13 22:17:59,496 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:59,496 INFO L485 AbstractCegarLoop]: Abstraction has 456 states and 1397 transitions. [2025-04-13 22:17:59,496 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:59,496 INFO L278 IsEmpty]: Start isEmpty. Operand 456 states and 1397 transitions. [2025-04-13 22:17:59,497 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:59,497 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:59,497 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:59,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Ended with exit code 0 [2025-04-13 22:17:59,697 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2025-04-13 22:17:59,697 INFO L403 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:59,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:59,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1646787044, now seen corresponding path program 88 times [2025-04-13 22:17:59,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:59,698 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621405698] [2025-04-13 22:17:59,698 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:17:59,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:59,708 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:59,712 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-13 22:17:59,712 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:17:59,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:59,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:59,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621405698] [2025-04-13 22:17:59,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621405698] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:59,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312208607] [2025-04-13 22:17:59,824 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:17:59,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:59,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:59,825 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:59,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2025-04-13 22:18:00,143 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:18:00,152 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-13 22:18:00,152 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:18:00,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:00,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 22:18:00,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:00,226 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:00,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:00,309 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:18:00,309 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 22:18:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:00,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312208607] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:00,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:00,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-04-13 22:18:00,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221402628] [2025-04-13 22:18:00,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:00,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:18:00,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:00,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:18:00,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:18:00,383 INFO L87 Difference]: Start difference. First operand 456 states and 1397 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:01,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:01,948 INFO L93 Difference]: Finished difference Result 526 states and 1545 transitions. [2025-04-13 22:18:01,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:18:01,949 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:18:01,949 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:01,950 INFO L225 Difference]: With dead ends: 526 [2025-04-13 22:18:01,950 INFO L226 Difference]: Without dead ends: 519 [2025-04-13 22:18:01,950 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:18:01,951 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:01,951 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:18:01,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-04-13 22:18:02,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 454. [2025-04-13 22:18:02,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 3.068432671081678) internal successors, (1390), 453 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1390 transitions. [2025-04-13 22:18:02,702 INFO L79 Accepts]: Start accepts. Automaton has 454 states and 1390 transitions. Word has length 29 [2025-04-13 22:18:02,702 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:02,702 INFO L485 AbstractCegarLoop]: Abstraction has 454 states and 1390 transitions. [2025-04-13 22:18:02,702 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:02,702 INFO L278 IsEmpty]: Start isEmpty. Operand 454 states and 1390 transitions. [2025-04-13 22:18:02,703 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:02,703 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:02,703 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:02,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Ended with exit code 0 [2025-04-13 22:18:02,903 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106,98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:02,903 INFO L403 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:02,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:02,904 INFO L85 PathProgramCache]: Analyzing trace with hash -713323335, now seen corresponding path program 89 times [2025-04-13 22:18:02,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:02,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924469271] [2025-04-13 22:18:02,904 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:18:02,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:02,914 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:02,932 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:18:02,932 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:18:02,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:03,245 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:18:03,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:03,245 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924469271] [2025-04-13 22:18:03,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924469271] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:03,245 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9831158] [2025-04-13 22:18:03,245 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:18:03,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:03,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:03,247 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:03,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2025-04-13 22:18:03,561 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:03,671 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:18:03,671 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:18:03,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:03,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:18:03,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:03,799 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:18:03,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:03,905 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:18:03,905 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 83 [2025-04-13 22:18:03,969 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:03,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9831158] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:03,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:03,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9] total 27 [2025-04-13 22:18:03,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136598742] [2025-04-13 22:18:03,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:03,969 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:18:03,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:03,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:18:03,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:18:03,970 INFO L87 Difference]: Start difference. First operand 454 states and 1390 transitions. Second operand has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:05,513 INFO L93 Difference]: Finished difference Result 493 states and 1485 transitions. [2025-04-13 22:18:05,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:18:05,513 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:18:05,513 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:05,514 INFO L225 Difference]: With dead ends: 493 [2025-04-13 22:18:05,514 INFO L226 Difference]: Without dead ends: 485 [2025-04-13 22:18:05,514 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=1198, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:18:05,515 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:05,515 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:18:05,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-04-13 22:18:06,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 454. [2025-04-13 22:18:06,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 3.068432671081678) internal successors, (1390), 453 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:06,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1390 transitions. [2025-04-13 22:18:06,251 INFO L79 Accepts]: Start accepts. Automaton has 454 states and 1390 transitions. Word has length 29 [2025-04-13 22:18:06,251 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:06,251 INFO L485 AbstractCegarLoop]: Abstraction has 454 states and 1390 transitions. [2025-04-13 22:18:06,251 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:06,251 INFO L278 IsEmpty]: Start isEmpty. Operand 454 states and 1390 transitions. [2025-04-13 22:18:06,252 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:06,252 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:06,252 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:06,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Ended with exit code 0 [2025-04-13 22:18:06,452 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2025-04-13 22:18:06,452 INFO L403 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:06,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:06,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1705524528, now seen corresponding path program 90 times [2025-04-13 22:18:06,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:06,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900488471] [2025-04-13 22:18:06,453 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:18:06,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:06,464 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:06,481 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:18:06,481 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:18:06,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:06,766 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:06,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:06,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900488471] [2025-04-13 22:18:06,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900488471] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:06,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872491938] [2025-04-13 22:18:06,766 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:18:06,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:06,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:06,768 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:06,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2025-04-13 22:18:07,092 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:07,117 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:18:07,117 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:18:07,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:07,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 22:18:07,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:07,275 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:07,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:07,461 INFO L325 Elim1Store]: treesize reduction 43, result has 72.4 percent of original size [2025-04-13 22:18:07,461 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 62 treesize of output 128 [2025-04-13 22:18:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:07,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872491938] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:07,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:07,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 25 [2025-04-13 22:18:07,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113417693] [2025-04-13 22:18:07,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:07,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:18:07,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:07,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:18:07,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:18:07,539 INFO L87 Difference]: Start difference. First operand 454 states and 1390 transitions. Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:09,604 INFO L93 Difference]: Finished difference Result 572 states and 1667 transitions. [2025-04-13 22:18:09,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:18:09,604 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:18:09,604 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:09,605 INFO L225 Difference]: With dead ends: 572 [2025-04-13 22:18:09,605 INFO L226 Difference]: Without dead ends: 565 [2025-04-13 22:18:09,606 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=1099, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:18:09,606 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:09,606 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:18:09,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-04-13 22:18:10,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 456. [2025-04-13 22:18:10,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 3.074725274725275) internal successors, (1399), 455 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:10,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1399 transitions. [2025-04-13 22:18:10,344 INFO L79 Accepts]: Start accepts. Automaton has 456 states and 1399 transitions. Word has length 29 [2025-04-13 22:18:10,344 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:10,344 INFO L485 AbstractCegarLoop]: Abstraction has 456 states and 1399 transitions. [2025-04-13 22:18:10,344 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:10,344 INFO L278 IsEmpty]: Start isEmpty. Operand 456 states and 1399 transitions. [2025-04-13 22:18:10,344 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:10,344 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:10,345 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:10,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Forceful destruction successful, exit code 0 [2025-04-13 22:18:10,545 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:10,545 INFO L403 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:10,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:10,545 INFO L85 PathProgramCache]: Analyzing trace with hash 36335972, now seen corresponding path program 91 times [2025-04-13 22:18:10,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:10,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017833974] [2025-04-13 22:18:10,545 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:18:10,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:10,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:18:10,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:18:10,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:18:10,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:18:11,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:11,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017833974] [2025-04-13 22:18:11,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017833974] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:11,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161810865] [2025-04-13 22:18:11,028 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:18:11,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:11,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:11,030 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:11,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2025-04-13 22:18:11,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:18:11,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:18:11,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:18:11,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:11,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 22:18:11,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:11,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:11,547 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:18:11,548 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 22:18:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:11,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161810865] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:11,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:11,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2025-04-13 22:18:11,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672811469] [2025-04-13 22:18:11,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:11,625 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:18:11,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:11,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:18:11,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:18:11,625 INFO L87 Difference]: Start difference. First operand 456 states and 1399 transitions. Second operand has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:13,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:13,988 INFO L93 Difference]: Finished difference Result 607 states and 1730 transitions. [2025-04-13 22:18:13,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:18:13,988 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:18:13,988 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:13,990 INFO L225 Difference]: With dead ends: 607 [2025-04-13 22:18:13,990 INFO L226 Difference]: Without dead ends: 600 [2025-04-13 22:18:13,990 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=289, Invalid=2161, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:18:13,990 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 134 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:13,990 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 0 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:18:13,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-04-13 22:18:14,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 453. [2025-04-13 22:18:14,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 3.0685840707964602) internal successors, (1387), 452 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:14,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 1387 transitions. [2025-04-13 22:18:14,752 INFO L79 Accepts]: Start accepts. Automaton has 453 states and 1387 transitions. Word has length 29 [2025-04-13 22:18:14,752 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:14,752 INFO L485 AbstractCegarLoop]: Abstraction has 453 states and 1387 transitions. [2025-04-13 22:18:14,752 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:14,752 INFO L278 IsEmpty]: Start isEmpty. Operand 453 states and 1387 transitions. [2025-04-13 22:18:14,752 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:14,752 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:14,752 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:14,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Ended with exit code 0 [2025-04-13 22:18:14,953 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:14,953 INFO L403 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:14,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:14,953 INFO L85 PathProgramCache]: Analyzing trace with hash 73068275, now seen corresponding path program 92 times [2025-04-13 22:18:14,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:14,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122223749] [2025-04-13 22:18:14,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:18:14,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:14,964 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:18:14,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:18:14,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:18:14,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:15,315 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:15,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:15,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122223749] [2025-04-13 22:18:15,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122223749] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:15,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352661957] [2025-04-13 22:18:15,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:18:15,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:15,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:15,317 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:15,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2025-04-13 22:18:15,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:18:15,661 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:18:15,661 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:18:15,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:15,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 22:18:15,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:18:15,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:15,976 INFO L325 Elim1Store]: treesize reduction 22, result has 87.4 percent of original size [2025-04-13 22:18:15,976 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 70 treesize of output 171 [2025-04-13 22:18:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:16,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352661957] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:16,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:16,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 31 [2025-04-13 22:18:16,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094981010] [2025-04-13 22:18:16,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:16,222 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:18:16,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:16,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:18:16,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:18:16,222 INFO L87 Difference]: Start difference. First operand 453 states and 1387 transitions. Second operand has 31 states, 31 states have (on average 1.903225806451613) internal successors, (59), 31 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:19,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:19,226 INFO L93 Difference]: Finished difference Result 668 states and 1877 transitions. [2025-04-13 22:18:19,226 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 22:18:19,226 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.903225806451613) internal successors, (59), 31 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:18:19,226 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:19,228 INFO L225 Difference]: With dead ends: 668 [2025-04-13 22:18:19,228 INFO L226 Difference]: Without dead ends: 648 [2025-04-13 22:18:19,228 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1189 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=583, Invalid=3449, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 22:18:19,229 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 149 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:19,229 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 0 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:18:19,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-04-13 22:18:20,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 477. [2025-04-13 22:18:20,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 3.0861344537815127) internal successors, (1469), 476 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:20,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1469 transitions. [2025-04-13 22:18:20,053 INFO L79 Accepts]: Start accepts. Automaton has 477 states and 1469 transitions. Word has length 29 [2025-04-13 22:18:20,053 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:20,053 INFO L485 AbstractCegarLoop]: Abstraction has 477 states and 1469 transitions. [2025-04-13 22:18:20,053 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.903225806451613) internal successors, (59), 31 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:20,053 INFO L278 IsEmpty]: Start isEmpty. Operand 477 states and 1469 transitions. [2025-04-13 22:18:20,054 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:20,054 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:20,054 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:20,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Ended with exit code 0 [2025-04-13 22:18:20,254 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:20,254 INFO L403 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:20,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:20,255 INFO L85 PathProgramCache]: Analyzing trace with hash 541396132, now seen corresponding path program 93 times [2025-04-13 22:18:20,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:20,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073942109] [2025-04-13 22:18:20,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:18:20,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:20,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:20,279 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 22:18:20,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:18:20,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:20,546 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:20,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:20,546 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073942109] [2025-04-13 22:18:20,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073942109] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:20,546 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083933376] [2025-04-13 22:18:20,546 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:18:20,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:20,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:20,548 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:20,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2025-04-13 22:18:20,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:20,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 22:18:20,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:18:20,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:20,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:18:20,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:20,997 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:20,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:21,080 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:18:21,080 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 22:18:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:21,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083933376] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:21,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:21,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 22 [2025-04-13 22:18:21,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960861039] [2025-04-13 22:18:21,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:21,156 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:18:21,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:21,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:18:21,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:18:21,157 INFO L87 Difference]: Start difference. First operand 477 states and 1469 transitions. Second operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:23,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:23,223 INFO L93 Difference]: Finished difference Result 583 states and 1697 transitions. [2025-04-13 22:18:23,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:18:23,223 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:18:23,223 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:23,225 INFO L225 Difference]: With dead ends: 583 [2025-04-13 22:18:23,225 INFO L226 Difference]: Without dead ends: 576 [2025-04-13 22:18:23,225 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:18:23,225 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:23,225 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:18:23,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-04-13 22:18:24,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 473. [2025-04-13 22:18:24,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 3.0783898305084745) internal successors, (1453), 472 states have internal predecessors, (1453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:24,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1453 transitions. [2025-04-13 22:18:24,036 INFO L79 Accepts]: Start accepts. Automaton has 473 states and 1453 transitions. Word has length 29 [2025-04-13 22:18:24,037 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:24,037 INFO L485 AbstractCegarLoop]: Abstraction has 473 states and 1453 transitions. [2025-04-13 22:18:24,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:24,037 INFO L278 IsEmpty]: Start isEmpty. Operand 473 states and 1453 transitions. [2025-04-13 22:18:24,037 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:24,037 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:24,037 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:24,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Ended with exit code 0 [2025-04-13 22:18:24,237 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2025-04-13 22:18:24,238 INFO L403 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:24,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:24,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1474859841, now seen corresponding path program 94 times [2025-04-13 22:18:24,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:24,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257738367] [2025-04-13 22:18:24,238 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:18:24,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:24,249 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:18:24,252 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-13 22:18:24,252 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:18:24,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:24,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:24,383 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257738367] [2025-04-13 22:18:24,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257738367] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:24,383 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722470633] [2025-04-13 22:18:24,383 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:18:24,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:24,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:24,385 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:24,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2025-04-13 22:18:24,712 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:18:24,721 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-13 22:18:24,721 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:18:24,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:24,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 22:18:24,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:24,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:25,013 INFO L325 Elim1Store]: treesize reduction 22, result has 85.9 percent of original size [2025-04-13 22:18:25,014 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 150 [2025-04-13 22:18:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:25,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722470633] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:25,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:25,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-04-13 22:18:25,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965703187] [2025-04-13 22:18:25,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:25,184 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:18:25,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:25,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:18:25,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:18:25,184 INFO L87 Difference]: Start difference. First operand 473 states and 1453 transitions. Second operand has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:27,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:27,485 INFO L93 Difference]: Finished difference Result 634 states and 1862 transitions. [2025-04-13 22:18:27,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:18:27,485 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:18:27,486 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:27,487 INFO L225 Difference]: With dead ends: 634 [2025-04-13 22:18:27,487 INFO L226 Difference]: Without dead ends: 626 [2025-04-13 22:18:27,488 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:18:27,488 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:27,488 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:18:27,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-04-13 22:18:28,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 467. [2025-04-13 22:18:28,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 3.072961373390558) internal successors, (1432), 466 states have internal predecessors, (1432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 1432 transitions. [2025-04-13 22:18:28,281 INFO L79 Accepts]: Start accepts. Automaton has 467 states and 1432 transitions. Word has length 29 [2025-04-13 22:18:28,282 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:28,282 INFO L485 AbstractCegarLoop]: Abstraction has 467 states and 1432 transitions. [2025-04-13 22:18:28,282 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:28,282 INFO L278 IsEmpty]: Start isEmpty. Operand 467 states and 1432 transitions. [2025-04-13 22:18:28,282 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:18:28,282 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:28,282 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:28,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Ended with exit code 0 [2025-04-13 22:18:28,483 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112,104 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:28,483 INFO L403 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:28,483 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:28,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1665609408, now seen corresponding path program 95 times [2025-04-13 22:18:28,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:28,483 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673845929] [2025-04-13 22:18:28,483 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:18:28,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:28,495 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:18:28,510 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:18:28,511 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:18:28,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:29,082 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 22:18:29,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:29,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673845929] [2025-04-13 22:18:29,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673845929] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:29,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013798674] [2025-04-13 22:18:29,083 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:18:29,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:29,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:29,085 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:29,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2025-04-13 22:18:29,418 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:18:29,477 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:18:29,477 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:18:29,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:29,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 22:18:29,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:29,845 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:18:29,845 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 22:18:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:18:29,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:30,152 INFO L325 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2025-04-13 22:18:30,152 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 180 treesize of output 165 [2025-04-13 22:18:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:30,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013798674] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:30,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:30,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 11] total 40 [2025-04-13 22:18:30,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244880497] [2025-04-13 22:18:30,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:30,335 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 22:18:30,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:30,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 22:18:30,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1498, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:18:30,335 INFO L87 Difference]: Start difference. First operand 467 states and 1432 transitions. Second operand has 41 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:33,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:33,434 INFO L93 Difference]: Finished difference Result 620 states and 1800 transitions. [2025-04-13 22:18:33,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 22:18:33,435 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:18:33,435 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:33,436 INFO L225 Difference]: With dead ends: 620 [2025-04-13 22:18:33,436 INFO L226 Difference]: Without dead ends: 585 [2025-04-13 22:18:33,437 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=504, Invalid=5046, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 22:18:33,437 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 246 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1884 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:33,437 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 0 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:18:33,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-04-13 22:18:34,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 476. [2025-04-13 22:18:34,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 3.0589473684210526) internal successors, (1453), 475 states have internal predecessors, (1453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:34,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1453 transitions. [2025-04-13 22:18:34,241 INFO L79 Accepts]: Start accepts. Automaton has 476 states and 1453 transitions. Word has length 30 [2025-04-13 22:18:34,241 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:34,241 INFO L485 AbstractCegarLoop]: Abstraction has 476 states and 1453 transitions. [2025-04-13 22:18:34,241 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:34,241 INFO L278 IsEmpty]: Start isEmpty. Operand 476 states and 1453 transitions. [2025-04-13 22:18:34,242 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:18:34,242 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:34,242 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:34,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Ended with exit code 0 [2025-04-13 22:18:34,442 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113,105 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:34,442 INFO L403 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:34,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:34,443 INFO L85 PathProgramCache]: Analyzing trace with hash 876464194, now seen corresponding path program 96 times [2025-04-13 22:18:34,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:34,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508061745] [2025-04-13 22:18:34,443 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:18:34,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:34,454 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:18:34,470 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:18:34,470 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:18:34,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:34,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:34,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508061745] [2025-04-13 22:18:34,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508061745] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:34,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977006068] [2025-04-13 22:18:34,935 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:18:34,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:34,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:34,936 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:34,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2025-04-13 22:18:35,270 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:18:35,298 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:18:35,298 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:18:35,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:35,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:18:35,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:35,636 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:18:35,636 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:18:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:35,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:36,196 INFO L325 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2025-04-13 22:18:36,196 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 134 treesize of output 190 [2025-04-13 22:18:37,299 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:37,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977006068] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:37,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:37,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 36 [2025-04-13 22:18:37,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132221078] [2025-04-13 22:18:37,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:37,299 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:18:37,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:37,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:18:37,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1198, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:18:37,300 INFO L87 Difference]: Start difference. First operand 476 states and 1453 transitions. Second operand has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:45,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:45,333 INFO L93 Difference]: Finished difference Result 896 states and 2437 transitions. [2025-04-13 22:18:45,333 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-04-13 22:18:45,333 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:18:45,333 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:45,335 INFO L225 Difference]: With dead ends: 896 [2025-04-13 22:18:45,335 INFO L226 Difference]: Without dead ends: 854 [2025-04-13 22:18:45,336 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3780 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1132, Invalid=10858, Unknown=0, NotChecked=0, Total=11990 [2025-04-13 22:18:45,336 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 471 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2253 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:45,336 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 0 Invalid, 2297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2253 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 22:18:45,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2025-04-13 22:18:46,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 478. [2025-04-13 22:18:46,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 3.056603773584906) internal successors, (1458), 477 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1458 transitions. [2025-04-13 22:18:46,162 INFO L79 Accepts]: Start accepts. Automaton has 478 states and 1458 transitions. Word has length 30 [2025-04-13 22:18:46,162 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:46,162 INFO L485 AbstractCegarLoop]: Abstraction has 478 states and 1458 transitions. [2025-04-13 22:18:46,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:46,162 INFO L278 IsEmpty]: Start isEmpty. Operand 478 states and 1458 transitions. [2025-04-13 22:18:46,163 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:18:46,163 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:46,163 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:46,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Forceful destruction successful, exit code 0 [2025-04-13 22:18:46,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2025-04-13 22:18:46,363 INFO L403 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:46,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:46,364 INFO L85 PathProgramCache]: Analyzing trace with hash 869923088, now seen corresponding path program 97 times [2025-04-13 22:18:46,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:46,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366196447] [2025-04-13 22:18:46,364 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:18:46,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:46,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:18:46,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:18:46,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:18:46,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:46,953 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:18:46,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:46,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366196447] [2025-04-13 22:18:46,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366196447] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:46,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717549874] [2025-04-13 22:18:46,954 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:18:46,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:46,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:46,956 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:46,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2025-04-13 22:18:47,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:18:47,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:18:47,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:18:47,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:47,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:18:47,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:47,576 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:18:47,576 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:18:47,599 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:47,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:47,838 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:47,838 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 212 [2025-04-13 22:18:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:48,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717549874] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:48,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:48,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 39 [2025-04-13 22:18:48,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213137766] [2025-04-13 22:18:48,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:48,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 22:18:48,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:48,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 22:18:48,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1431, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:18:48,605 INFO L87 Difference]: Start difference. First operand 478 states and 1458 transitions. Second operand has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:53,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:53,310 INFO L93 Difference]: Finished difference Result 685 states and 1964 transitions. [2025-04-13 22:18:53,310 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-13 22:18:53,310 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:18:53,310 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:53,312 INFO L225 Difference]: With dead ends: 685 [2025-04-13 22:18:53,312 INFO L226 Difference]: Without dead ends: 650 [2025-04-13 22:18:53,312 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2067 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=798, Invalid=7944, Unknown=0, NotChecked=0, Total=8742 [2025-04-13 22:18:53,312 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 297 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2343 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:53,312 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 0 Invalid, 2397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2343 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:18:53,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-04-13 22:18:54,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 486. [2025-04-13 22:18:54,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 3.0597938144329895) internal successors, (1484), 485 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1484 transitions. [2025-04-13 22:18:54,211 INFO L79 Accepts]: Start accepts. Automaton has 486 states and 1484 transitions. Word has length 30 [2025-04-13 22:18:54,211 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:54,211 INFO L485 AbstractCegarLoop]: Abstraction has 486 states and 1484 transitions. [2025-04-13 22:18:54,211 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:54,211 INFO L278 IsEmpty]: Start isEmpty. Operand 486 states and 1484 transitions. [2025-04-13 22:18:54,212 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:18:54,212 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:54,212 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:54,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Forceful destruction successful, exit code 0 [2025-04-13 22:18:54,412 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 107 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable115 [2025-04-13 22:18:54,412 INFO L403 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:54,413 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:54,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1901234558, now seen corresponding path program 98 times [2025-04-13 22:18:54,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:54,413 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63416872] [2025-04-13 22:18:54,413 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:18:54,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:54,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:18:54,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:18:54,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:18:54,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:54,949 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:54,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:54,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63416872] [2025-04-13 22:18:54,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63416872] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:54,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069682187] [2025-04-13 22:18:54,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:18:54,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:54,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:54,951 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:54,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2025-04-13 22:18:55,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:18:55,324 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:18:55,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:18:55,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:55,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:18:55,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:55,684 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:18:55,684 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:18:55,710 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:18:55,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:56,219 INFO L325 Elim1Store]: treesize reduction 11, result has 93.1 percent of original size [2025-04-13 22:18:56,219 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 134 treesize of output 194 [2025-04-13 22:18:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:57,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069682187] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:57,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:57,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 11] total 39 [2025-04-13 22:18:57,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403480868] [2025-04-13 22:18:57,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:57,165 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 22:18:57,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:57,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 22:18:57,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1394, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:18:57,166 INFO L87 Difference]: Start difference. First operand 486 states and 1484 transitions. Second operand has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:06,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:06,387 INFO L93 Difference]: Finished difference Result 899 states and 2416 transitions. [2025-04-13 22:19:06,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-04-13 22:19:06,387 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:19:06,387 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:06,389 INFO L225 Difference]: With dead ends: 899 [2025-04-13 22:19:06,389 INFO L226 Difference]: Without dead ends: 845 [2025-04-13 22:19:06,390 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3293 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1228, Invalid=9902, Unknown=0, NotChecked=0, Total=11130 [2025-04-13 22:19:06,390 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 356 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2515 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:06,390 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 0 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2515 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 22:19:06,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-04-13 22:19:07,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 505. [2025-04-13 22:19:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 3.0674603174603177) internal successors, (1546), 504 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1546 transitions. [2025-04-13 22:19:07,331 INFO L79 Accepts]: Start accepts. Automaton has 505 states and 1546 transitions. Word has length 30 [2025-04-13 22:19:07,331 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:07,331 INFO L485 AbstractCegarLoop]: Abstraction has 505 states and 1546 transitions. [2025-04-13 22:19:07,331 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:07,331 INFO L278 IsEmpty]: Start isEmpty. Operand 505 states and 1546 transitions. [2025-04-13 22:19:07,331 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:19:07,331 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:07,331 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:19:07,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Ended with exit code 0 [2025-04-13 22:19:07,532 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116,108 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:07,532 INFO L403 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:07,532 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:07,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1852079408, now seen corresponding path program 99 times [2025-04-13 22:19:07,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:07,532 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056164257] [2025-04-13 22:19:07,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:19:07,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:07,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:19:07,560 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 22:19:07,560 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:19:07,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:07,994 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:07,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:07,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056164257] [2025-04-13 22:19:07,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056164257] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:07,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325516365] [2025-04-13 22:19:07,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:19:07,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:07,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:07,996 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:19:07,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2025-04-13 22:19:08,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:19:08,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 22:19:08,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:19:08,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:08,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 22:19:08,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:08,717 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:19:08,717 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:19:08,739 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:08,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:09,497 INFO L325 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2025-04-13 22:19:09,497 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 168 treesize of output 212 [2025-04-13 22:19:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:10,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325516365] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:10,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:10,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 36 [2025-04-13 22:19:10,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567384585] [2025-04-13 22:19:10,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:10,963 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:19:10,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:10,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:19:10,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1178, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:19:10,963 INFO L87 Difference]: Start difference. First operand 505 states and 1546 transitions. Second operand has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:29,326 INFO L93 Difference]: Finished difference Result 1277 states and 3302 transitions. [2025-04-13 22:19:29,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2025-04-13 22:19:29,326 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:19:29,326 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:29,328 INFO L225 Difference]: With dead ends: 1277 [2025-04-13 22:19:29,328 INFO L226 Difference]: Without dead ends: 1224 [2025-04-13 22:19:29,330 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12173 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=3266, Invalid=28596, Unknown=0, NotChecked=0, Total=31862 [2025-04-13 22:19:29,330 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 713 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3723 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 3723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:29,330 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 0 Invalid, 3906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 3723 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 22:19:29,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2025-04-13 22:19:30,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 534. [2025-04-13 22:19:30,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 3.103189493433396) internal successors, (1654), 533 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:30,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 1654 transitions. [2025-04-13 22:19:30,416 INFO L79 Accepts]: Start accepts. Automaton has 534 states and 1654 transitions. Word has length 30 [2025-04-13 22:19:30,416 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:30,416 INFO L485 AbstractCegarLoop]: Abstraction has 534 states and 1654 transitions. [2025-04-13 22:19:30,416 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:30,416 INFO L278 IsEmpty]: Start isEmpty. Operand 534 states and 1654 transitions. [2025-04-13 22:19:30,417 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:19:30,417 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:30,417 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:19:30,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Forceful destruction successful, exit code 0 [2025-04-13 22:19:30,617 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117,109 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:30,617 INFO L403 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:30,617 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:30,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1849571198, now seen corresponding path program 100 times [2025-04-13 22:19:30,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:30,618 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791534663] [2025-04-13 22:19:30,618 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:19:30,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:30,630 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:19:30,634 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 22:19:30,634 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:19:30,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:30,838 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:30,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:30,838 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791534663] [2025-04-13 22:19:30,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791534663] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:30,838 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598950153] [2025-04-13 22:19:30,838 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:19:30,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:30,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:30,840 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:19:30,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2025-04-13 22:19:31,187 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:19:31,197 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 22:19:31,197 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:19:31,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:31,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:19:31,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:31,340 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:19:31,340 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:19:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:31,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:31,468 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:19:31,469 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 22:19:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:31,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598950153] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:31,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:31,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-04-13 22:19:31,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557541019] [2025-04-13 22:19:31,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:31,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:19:31,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:31,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:19:31,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:19:31,961 INFO L87 Difference]: Start difference. First operand 534 states and 1654 transitions. Second operand has 24 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:35,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:35,659 INFO L93 Difference]: Finished difference Result 756 states and 2193 transitions. [2025-04-13 22:19:35,659 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 22:19:35,660 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:19:35,660 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:35,661 INFO L225 Difference]: With dead ends: 756 [2025-04-13 22:19:35,661 INFO L226 Difference]: Without dead ends: 737 [2025-04-13 22:19:35,662 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=322, Invalid=2984, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 22:19:35,662 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 167 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1535 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:35,662 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 0 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:19:35,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2025-04-13 22:19:36,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 546. [2025-04-13 22:19:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 3.1009174311926606) internal successors, (1690), 545 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1690 transitions. [2025-04-13 22:19:36,790 INFO L79 Accepts]: Start accepts. Automaton has 546 states and 1690 transitions. Word has length 30 [2025-04-13 22:19:36,790 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:36,790 INFO L485 AbstractCegarLoop]: Abstraction has 546 states and 1690 transitions. [2025-04-13 22:19:36,790 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:36,791 INFO L278 IsEmpty]: Start isEmpty. Operand 546 states and 1690 transitions. [2025-04-13 22:19:36,791 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:19:36,791 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:36,791 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:19:36,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Ended with exit code 0 [2025-04-13 22:19:36,991 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2025-04-13 22:19:36,992 INFO L403 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:36,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:36,992 INFO L85 PathProgramCache]: Analyzing trace with hash 2028697250, now seen corresponding path program 101 times [2025-04-13 22:19:36,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:36,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301014113] [2025-04-13 22:19:36,992 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:19:36,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:37,004 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:19:37,020 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:19:37,020 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:19:37,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:37,480 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 22:19:37,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:37,480 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301014113] [2025-04-13 22:19:37,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301014113] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:37,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753335160] [2025-04-13 22:19:37,481 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:19:37,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:37,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:37,482 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:19:37,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2025-04-13 22:19:37,845 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:19:37,886 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:19:37,886 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:19:37,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:37,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 22:19:37,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:38,178 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:19:38,178 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 22:19:38,204 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:19:38,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:38,324 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:19:38,324 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 191 [2025-04-13 22:19:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:38,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753335160] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:38,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:38,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 11] total 36 [2025-04-13 22:19:38,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147993833] [2025-04-13 22:19:38,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:38,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:19:38,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:38,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:19:38,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1209, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:19:38,777 INFO L87 Difference]: Start difference. First operand 546 states and 1690 transitions. Second operand has 37 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:42,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:42,573 INFO L93 Difference]: Finished difference Result 730 states and 2129 transitions. [2025-04-13 22:19:42,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 22:19:42,574 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:19:42,574 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:42,576 INFO L225 Difference]: With dead ends: 730 [2025-04-13 22:19:42,576 INFO L226 Difference]: Without dead ends: 701 [2025-04-13 22:19:42,576 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=523, Invalid=5177, Unknown=0, NotChecked=0, Total=5700 [2025-04-13 22:19:42,576 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 211 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2300 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:42,576 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 0 Invalid, 2328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2300 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:19:42,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-04-13 22:19:43,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 566. [2025-04-13 22:19:43,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 3.1150442477876106) internal successors, (1760), 565 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:43,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1760 transitions. [2025-04-13 22:19:43,763 INFO L79 Accepts]: Start accepts. Automaton has 566 states and 1760 transitions. Word has length 30 [2025-04-13 22:19:43,764 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:43,764 INFO L485 AbstractCegarLoop]: Abstraction has 566 states and 1760 transitions. [2025-04-13 22:19:43,764 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:43,764 INFO L278 IsEmpty]: Start isEmpty. Operand 566 states and 1760 transitions. [2025-04-13 22:19:43,764 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:19:43,764 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:43,764 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:19:43,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Ended with exit code 0 [2025-04-13 22:19:43,965 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,111 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:43,965 INFO L403 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:43,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:43,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2031205460, now seen corresponding path program 102 times [2025-04-13 22:19:43,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:43,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875441694] [2025-04-13 22:19:43,965 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:19:43,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:43,977 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:19:43,994 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:19:43,994 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:19:43,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:44,492 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:44,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:44,492 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875441694] [2025-04-13 22:19:44,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875441694] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:44,492 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409400385] [2025-04-13 22:19:44,492 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:19:44,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:44,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:44,494 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:19:44,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2025-04-13 22:19:44,845 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:19:44,872 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:19:44,872 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:19:44,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:44,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 22:19:44,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:45,172 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:19:45,173 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:19:45,203 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:45,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:45,975 INFO L325 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2025-04-13 22:19:45,975 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 178 treesize of output 210 [2025-04-13 22:19:47,171 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:47,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409400385] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:47,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:47,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 22:19:47,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955980509] [2025-04-13 22:19:47,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:47,172 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:19:47,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:47,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:19:47,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=928, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:19:47,172 INFO L87 Difference]: Start difference. First operand 566 states and 1760 transitions. Second operand has 33 states, 32 states have (on average 1.71875) internal successors, (55), 33 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:02,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:02,728 INFO L93 Difference]: Finished difference Result 1229 states and 3267 transitions. [2025-04-13 22:20:02,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2025-04-13 22:20:02,728 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.71875) internal successors, (55), 33 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:20:02,728 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:02,731 INFO L225 Difference]: With dead ends: 1229 [2025-04-13 22:20:02,731 INFO L226 Difference]: Without dead ends: 1168 [2025-04-13 22:20:02,732 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8004 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=2260, Invalid=19202, Unknown=0, NotChecked=0, Total=21462 [2025-04-13 22:20:02,732 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 420 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:02,732 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 0 Invalid, 2582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 2418 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 22:20:02,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2025-04-13 22:20:03,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 578. [2025-04-13 22:20:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 577 states have (on average 3.1126516464471403) internal successors, (1796), 577 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:03,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 1796 transitions. [2025-04-13 22:20:03,952 INFO L79 Accepts]: Start accepts. Automaton has 578 states and 1796 transitions. Word has length 30 [2025-04-13 22:20:03,952 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:03,952 INFO L485 AbstractCegarLoop]: Abstraction has 578 states and 1796 transitions. [2025-04-13 22:20:03,952 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.71875) internal successors, (55), 33 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:03,953 INFO L278 IsEmpty]: Start isEmpty. Operand 578 states and 1796 transitions. [2025-04-13 22:20:03,953 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:20:03,953 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:03,953 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:03,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Ended with exit code 0 [2025-04-13 22:20:04,153 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,112 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:04,154 INFO L403 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:04,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:04,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2142027980, now seen corresponding path program 103 times [2025-04-13 22:20:04,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:04,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655138159] [2025-04-13 22:20:04,154 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:20:04,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:04,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:20:04,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:20:04,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:20:04,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:04,733 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:20:04,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:04,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655138159] [2025-04-13 22:20:04,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655138159] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:04,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139482119] [2025-04-13 22:20:04,734 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:20:04,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:04,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:04,736 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:20:04,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2025-04-13 22:20:05,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:20:05,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:20:05,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:20:05,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:05,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:20:05,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:05,342 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:20:05,342 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:20:05,369 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:20:05,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:05,560 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:05,560 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 230 treesize of output 228 [2025-04-13 22:20:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:20:06,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139482119] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:06,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:06,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 39 [2025-04-13 22:20:06,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917055517] [2025-04-13 22:20:06,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:06,171 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 22:20:06,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:06,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 22:20:06,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1426, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:20:06,171 INFO L87 Difference]: Start difference. First operand 578 states and 1796 transitions. Second operand has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:11,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:11,075 INFO L93 Difference]: Finished difference Result 751 states and 2182 transitions. [2025-04-13 22:20:11,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-04-13 22:20:11,075 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:20:11,075 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:11,077 INFO L225 Difference]: With dead ends: 751 [2025-04-13 22:20:11,077 INFO L226 Difference]: Without dead ends: 719 [2025-04-13 22:20:11,077 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2268 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=832, Invalid=8098, Unknown=0, NotChecked=0, Total=8930 [2025-04-13 22:20:11,078 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 274 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2320 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:11,078 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 0 Invalid, 2389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2320 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:20:11,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2025-04-13 22:20:12,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 582. [2025-04-13 22:20:12,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 3.0843373493975905) internal successors, (1792), 581 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:12,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1792 transitions. [2025-04-13 22:20:12,318 INFO L79 Accepts]: Start accepts. Automaton has 582 states and 1792 transitions. Word has length 30 [2025-04-13 22:20:12,318 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:12,318 INFO L485 AbstractCegarLoop]: Abstraction has 582 states and 1792 transitions. [2025-04-13 22:20:12,318 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:12,318 INFO L278 IsEmpty]: Start isEmpty. Operand 582 states and 1792 transitions. [2025-04-13 22:20:12,318 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:20:12,318 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:12,319 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:12,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Ended with exit code 0 [2025-04-13 22:20:12,519 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable121 [2025-04-13 22:20:12,519 INFO L403 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:12,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:12,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1176957954, now seen corresponding path program 104 times [2025-04-13 22:20:12,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:12,519 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888667202] [2025-04-13 22:20:12,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:20:12,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:12,531 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:20:12,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:20:12,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:20:12,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:20:12,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:12,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888667202] [2025-04-13 22:20:12,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888667202] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:12,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51099755] [2025-04-13 22:20:12,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:20:12,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:12,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:12,984 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:20:12,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2025-04-13 22:20:13,353 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:20:13,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:20:13,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:20:13,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:13,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:20:13,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:13,822 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:20:13,822 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:20:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:20:13,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:14,036 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:14,036 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 212 [2025-04-13 22:20:15,207 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:20:15,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51099755] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:15,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:15,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 11] total 39 [2025-04-13 22:20:15,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730187567] [2025-04-13 22:20:15,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:15,207 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 22:20:15,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:15,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 22:20:15,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1397, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:20:15,208 INFO L87 Difference]: Start difference. First operand 582 states and 1792 transitions. Second operand has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:20,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:20,513 INFO L93 Difference]: Finished difference Result 758 states and 2301 transitions. [2025-04-13 22:20:20,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 22:20:20,513 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:20:20,513 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:20,515 INFO L225 Difference]: With dead ends: 758 [2025-04-13 22:20:20,515 INFO L226 Difference]: Without dead ends: 695 [2025-04-13 22:20:20,516 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2213 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=950, Invalid=6360, Unknown=0, NotChecked=0, Total=7310 [2025-04-13 22:20:20,516 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 228 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2189 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:20,516 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 0 Invalid, 2289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2189 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:20:20,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-04-13 22:20:21,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 628. [2025-04-13 22:20:21,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 3.1371610845295055) internal successors, (1967), 627 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:21,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1967 transitions. [2025-04-13 22:20:21,953 INFO L79 Accepts]: Start accepts. Automaton has 628 states and 1967 transitions. Word has length 30 [2025-04-13 22:20:21,953 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:21,953 INFO L485 AbstractCegarLoop]: Abstraction has 628 states and 1967 transitions. [2025-04-13 22:20:21,953 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:21,953 INFO L278 IsEmpty]: Start isEmpty. Operand 628 states and 1967 transitions. [2025-04-13 22:20:21,954 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:20:21,954 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:21,954 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:21,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Ended with exit code 0 [2025-04-13 22:20:22,154 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122,114 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:22,154 INFO L403 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:22,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:22,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2073689360, now seen corresponding path program 105 times [2025-04-13 22:20:22,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:22,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797759642] [2025-04-13 22:20:22,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:20:22,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:22,166 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:20:22,190 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:20:22,190 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:20:22,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:20:22,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:22,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797759642] [2025-04-13 22:20:22,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797759642] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:22,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892559487] [2025-04-13 22:20:22,950 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:20:22,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:22,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:22,952 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:20:22,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2025-04-13 22:20:23,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:20:23,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:20:23,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:20:23,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:23,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:20:23,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:23,632 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:20:23,633 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 22:20:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:20:23,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:23,773 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:23,773 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 191 [2025-04-13 22:20:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:20:24,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892559487] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:24,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:24,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 11] total 39 [2025-04-13 22:20:24,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167230500] [2025-04-13 22:20:24,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:24,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 22:20:24,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:24,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 22:20:24,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1404, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:20:24,382 INFO L87 Difference]: Start difference. First operand 628 states and 1967 transitions. Second operand has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:28,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:28,474 INFO L93 Difference]: Finished difference Result 775 states and 2331 transitions. [2025-04-13 22:20:28,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 22:20:28,474 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:20:28,474 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:28,476 INFO L225 Difference]: With dead ends: 775 [2025-04-13 22:20:28,476 INFO L226 Difference]: Without dead ends: 753 [2025-04-13 22:20:28,476 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1339 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=565, Invalid=4985, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 22:20:28,476 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 168 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:28,476 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 0 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:20:28,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2025-04-13 22:20:29,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 652. [2025-04-13 22:20:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 651 states have (on average 3.1597542242703534) internal successors, (2057), 651 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 2057 transitions. [2025-04-13 22:20:29,984 INFO L79 Accepts]: Start accepts. Automaton has 652 states and 2057 transitions. Word has length 30 [2025-04-13 22:20:29,984 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:29,984 INFO L485 AbstractCegarLoop]: Abstraction has 652 states and 2057 transitions. [2025-04-13 22:20:29,984 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:29,984 INFO L278 IsEmpty]: Start isEmpty. Operand 652 states and 2057 transitions. [2025-04-13 22:20:29,985 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:20:29,985 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:29,985 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:29,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Ended with exit code 0 [2025-04-13 22:20:30,185 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 115 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable123 [2025-04-13 22:20:30,185 INFO L403 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:30,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:30,186 INFO L85 PathProgramCache]: Analyzing trace with hash 2076197570, now seen corresponding path program 106 times [2025-04-13 22:20:30,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:30,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091952774] [2025-04-13 22:20:30,186 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:20:30,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:30,198 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:20:30,202 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 22:20:30,202 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:20:30,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:30,411 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:20:30,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:30,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091952774] [2025-04-13 22:20:30,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091952774] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:30,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170828451] [2025-04-13 22:20:30,411 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:20:30,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:30,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:30,413 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:20:30,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2025-04-13 22:20:30,775 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:20:30,784 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 22:20:30,784 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:20:30,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:30,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:20:30,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:30,923 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:20:30,923 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:20:30,953 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:20:30,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:31,088 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:31,088 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 22:20:31,538 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:20:31,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170828451] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:31,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:31,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2025-04-13 22:20:31,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333786962] [2025-04-13 22:20:31,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:31,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:20:31,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:31,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:20:31,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:20:31,538 INFO L87 Difference]: Start difference. First operand 652 states and 2057 transitions. Second operand has 26 states, 25 states have (on average 1.64) internal successors, (41), 26 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:35,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:35,444 INFO L93 Difference]: Finished difference Result 794 states and 2382 transitions. [2025-04-13 22:20:35,444 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 22:20:35,444 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.64) internal successors, (41), 26 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:20:35,444 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:35,446 INFO L225 Difference]: With dead ends: 794 [2025-04-13 22:20:35,446 INFO L226 Difference]: Without dead ends: 775 [2025-04-13 22:20:35,447 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=368, Invalid=3172, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 22:20:35,447 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 151 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:35,447 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 0 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:20:35,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-04-13 22:20:36,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 652. [2025-04-13 22:20:36,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 651 states have (on average 3.153609831029186) internal successors, (2053), 651 states have internal predecessors, (2053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:36,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 2053 transitions. [2025-04-13 22:20:36,910 INFO L79 Accepts]: Start accepts. Automaton has 652 states and 2053 transitions. Word has length 30 [2025-04-13 22:20:36,910 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:36,910 INFO L485 AbstractCegarLoop]: Abstraction has 652 states and 2053 transitions. [2025-04-13 22:20:36,911 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.64) internal successors, (41), 26 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:36,911 INFO L278 IsEmpty]: Start isEmpty. Operand 652 states and 2053 transitions. [2025-04-13 22:20:36,911 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:20:36,911 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:36,911 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:36,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Ended with exit code 0 [2025-04-13 22:20:37,112 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124 [2025-04-13 22:20:37,112 INFO L403 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:37,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:37,112 INFO L85 PathProgramCache]: Analyzing trace with hash -2107947206, now seen corresponding path program 107 times [2025-04-13 22:20:37,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:37,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139079411] [2025-04-13 22:20:37,112 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:20:37,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:37,123 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:20:37,146 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:20:37,146 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:20:37,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:37,764 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:20:37,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:37,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139079411] [2025-04-13 22:20:37,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139079411] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:37,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16032472] [2025-04-13 22:20:37,764 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:20:37,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:37,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:37,766 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:20:37,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2025-04-13 22:20:38,142 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:20:38,210 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:20:38,210 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:20:38,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:38,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 22:20:38,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:38,523 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:20:38,523 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 22:20:38,554 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:20:38,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:38,712 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:38,713 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 22:20:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:20:39,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16032472] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:39,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:39,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 11] total 39 [2025-04-13 22:20:39,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372108795] [2025-04-13 22:20:39,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:39,351 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 22:20:39,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:39,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 22:20:39,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1425, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:20:39,352 INFO L87 Difference]: Start difference. First operand 652 states and 2053 transitions. Second operand has 40 states, 39 states have (on average 1.641025641025641) internal successors, (64), 40 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:43,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:43,958 INFO L93 Difference]: Finished difference Result 788 states and 2383 transitions. [2025-04-13 22:20:43,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-13 22:20:43,958 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.641025641025641) internal successors, (64), 40 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:20:43,958 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:43,961 INFO L225 Difference]: With dead ends: 788 [2025-04-13 22:20:43,961 INFO L226 Difference]: Without dead ends: 765 [2025-04-13 22:20:43,961 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1384 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=633, Invalid=5847, Unknown=0, NotChecked=0, Total=6480 [2025-04-13 22:20:43,962 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 221 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1816 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:43,962 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 0 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1816 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:20:43,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2025-04-13 22:20:45,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 654. [2025-04-13 22:20:45,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 653 states have (on average 3.1454823889739663) internal successors, (2054), 653 states have internal predecessors, (2054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:45,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 2054 transitions. [2025-04-13 22:20:45,460 INFO L79 Accepts]: Start accepts. Automaton has 654 states and 2054 transitions. Word has length 30 [2025-04-13 22:20:45,460 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:45,460 INFO L485 AbstractCegarLoop]: Abstraction has 654 states and 2054 transitions. [2025-04-13 22:20:45,460 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.641025641025641) internal successors, (64), 40 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:45,460 INFO L278 IsEmpty]: Start isEmpty. Operand 654 states and 2054 transitions. [2025-04-13 22:20:45,461 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:20:45,461 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:45,461 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:45,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Ended with exit code 0 [2025-04-13 22:20:45,661 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 117 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2025-04-13 22:20:45,662 INFO L403 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:45,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:45,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1327550914, now seen corresponding path program 108 times [2025-04-13 22:20:45,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:45,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355326817] [2025-04-13 22:20:45,662 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:20:45,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:45,674 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:20:45,691 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:20:45,691 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:20:45,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:20:46,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:46,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355326817] [2025-04-13 22:20:46,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355326817] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:46,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226511809] [2025-04-13 22:20:46,215 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:20:46,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:46,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:46,217 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:20:46,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2025-04-13 22:20:46,590 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:20:46,620 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:20:46,620 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:20:46,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:46,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:20:46,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:46,930 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:20:46,931 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:20:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:20:46,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:47,138 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:47,138 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 22:20:47,919 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:20:47,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226511809] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:47,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:47,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 36 [2025-04-13 22:20:47,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78014034] [2025-04-13 22:20:47,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:47,920 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:20:47,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:47,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:20:47,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1215, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:20:47,921 INFO L87 Difference]: Start difference. First operand 654 states and 2054 transitions. Second operand has 37 states, 36 states have (on average 1.75) internal successors, (63), 37 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:52,350 INFO L93 Difference]: Finished difference Result 777 states and 2345 transitions. [2025-04-13 22:20:52,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 22:20:52,351 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.75) internal successors, (63), 37 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:20:52,351 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:52,353 INFO L225 Difference]: With dead ends: 777 [2025-04-13 22:20:52,353 INFO L226 Difference]: Without dead ends: 736 [2025-04-13 22:20:52,353 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=519, Invalid=4593, Unknown=0, NotChecked=0, Total=5112 [2025-04-13 22:20:52,353 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 174 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:52,353 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 0 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:20:52,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2025-04-13 22:20:53,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 636. [2025-04-13 22:20:53,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 3.125984251968504) internal successors, (1985), 635 states have internal predecessors, (1985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:53,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1985 transitions. [2025-04-13 22:20:53,818 INFO L79 Accepts]: Start accepts. Automaton has 636 states and 1985 transitions. Word has length 30 [2025-04-13 22:20:53,818 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:53,818 INFO L485 AbstractCegarLoop]: Abstraction has 636 states and 1985 transitions. [2025-04-13 22:20:53,818 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.75) internal successors, (63), 37 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:53,818 INFO L278 IsEmpty]: Start isEmpty. Operand 636 states and 1985 transitions. [2025-04-13 22:20:53,819 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:20:53,819 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:53,819 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:53,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Ended with exit code 0 [2025-04-13 22:20:54,019 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126,118 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:54,020 INFO L403 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:54,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:54,020 INFO L85 PathProgramCache]: Analyzing trace with hash 159912226, now seen corresponding path program 109 times [2025-04-13 22:20:54,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:54,020 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299609873] [2025-04-13 22:20:54,020 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:20:54,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:54,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:20:54,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:20:54,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:20:54,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:54,689 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:20:54,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:54,689 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299609873] [2025-04-13 22:20:54,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299609873] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:54,689 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895722791] [2025-04-13 22:20:54,689 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:20:54,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:54,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:54,691 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:20:54,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2025-04-13 22:20:55,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:20:55,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:20:55,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:20:55,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:55,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:20:55,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:55,275 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:20:55,275 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:20:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:20:55,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:55,421 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:55,421 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 191 [2025-04-13 22:20:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:20:55,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895722791] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:55,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:55,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 37 [2025-04-13 22:20:55,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31542348] [2025-04-13 22:20:55,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:55,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 22:20:55,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:55,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 22:20:55,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1281, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:20:55,926 INFO L87 Difference]: Start difference. First operand 636 states and 1985 transitions. Second operand has 38 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 38 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:00,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:00,368 INFO L93 Difference]: Finished difference Result 775 states and 2286 transitions. [2025-04-13 22:21:00,371 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 22:21:00,371 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 38 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:21:00,371 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:00,373 INFO L225 Difference]: With dead ends: 775 [2025-04-13 22:21:00,373 INFO L226 Difference]: Without dead ends: 744 [2025-04-13 22:21:00,374 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1451 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=544, Invalid=5776, Unknown=0, NotChecked=0, Total=6320 [2025-04-13 22:21:00,374 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 178 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:00,374 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 0 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:21:00,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2025-04-13 22:21:01,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 640. [2025-04-13 22:21:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 639 states have (on average 3.1220657276995305) internal successors, (1995), 639 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:01,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1995 transitions. [2025-04-13 22:21:01,811 INFO L79 Accepts]: Start accepts. Automaton has 640 states and 1995 transitions. Word has length 30 [2025-04-13 22:21:01,811 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:01,812 INFO L485 AbstractCegarLoop]: Abstraction has 640 states and 1995 transitions. [2025-04-13 22:21:01,812 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 38 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:01,812 INFO L278 IsEmpty]: Start isEmpty. Operand 640 states and 1995 transitions. [2025-04-13 22:21:01,812 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:21:01,812 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:01,812 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:01,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Ended with exit code 0 [2025-04-13 22:21:02,013 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable127 [2025-04-13 22:21:02,013 INFO L403 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:02,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:02,013 INFO L85 PathProgramCache]: Analyzing trace with hash 355251708, now seen corresponding path program 110 times [2025-04-13 22:21:02,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:02,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348600113] [2025-04-13 22:21:02,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:21:02,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:02,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:21:02,037 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:21:02,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:21:02,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:21:02,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:02,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348600113] [2025-04-13 22:21:02,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348600113] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:02,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443355670] [2025-04-13 22:21:02,481 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:21:02,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:02,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:02,483 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:21:02,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2025-04-13 22:21:02,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:21:02,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:21:02,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:21:02,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:02,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 22:21:02,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:03,108 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:21:03,108 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:21:03,127 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:21:03,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:03,252 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:03,252 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 191 [2025-04-13 22:21:03,762 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:21:03,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443355670] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:03,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:03,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 11] total 33 [2025-04-13 22:21:03,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827532514] [2025-04-13 22:21:03,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:03,763 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:21:03,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:03,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:21:03,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=981, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:21:03,764 INFO L87 Difference]: Start difference. First operand 640 states and 1995 transitions. Second operand has 34 states, 33 states have (on average 1.696969696969697) internal successors, (56), 34 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:07,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:07,166 INFO L93 Difference]: Finished difference Result 722 states and 2186 transitions. [2025-04-13 22:21:07,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 22:21:07,166 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.696969696969697) internal successors, (56), 34 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:21:07,167 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:07,169 INFO L225 Difference]: With dead ends: 722 [2025-04-13 22:21:07,169 INFO L226 Difference]: Without dead ends: 700 [2025-04-13 22:21:07,169 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=482, Invalid=3678, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 22:21:07,169 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 134 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:07,169 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 0 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:21:07,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-04-13 22:21:08,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 648. [2025-04-13 22:21:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 647 states have (on average 3.114374034003091) internal successors, (2015), 647 states have internal predecessors, (2015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:08,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 2015 transitions. [2025-04-13 22:21:08,699 INFO L79 Accepts]: Start accepts. Automaton has 648 states and 2015 transitions. Word has length 30 [2025-04-13 22:21:08,699 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:08,699 INFO L485 AbstractCegarLoop]: Abstraction has 648 states and 2015 transitions. [2025-04-13 22:21:08,699 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.696969696969697) internal successors, (56), 34 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:08,699 INFO L278 IsEmpty]: Start isEmpty. Operand 648 states and 2015 transitions. [2025-04-13 22:21:08,700 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:21:08,700 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:08,700 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:08,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Forceful destruction successful, exit code 0 [2025-04-13 22:21:08,900 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 120 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128 [2025-04-13 22:21:08,900 INFO L403 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:08,901 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:08,901 INFO L85 PathProgramCache]: Analyzing trace with hash 2065847778, now seen corresponding path program 111 times [2025-04-13 22:21:08,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:08,901 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59278506] [2025-04-13 22:21:08,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:21:08,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:08,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:21:08,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 22:21:08,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:21:08,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:09,400 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:21:09,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:09,400 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59278506] [2025-04-13 22:21:09,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59278506] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:09,400 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197214344] [2025-04-13 22:21:09,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:21:09,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:09,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:09,402 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:21:09,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2025-04-13 22:21:09,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:21:09,807 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 22:21:09,807 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:21:09,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:09,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:21:09,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:10,090 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:21:10,090 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:21:10,110 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:21:10,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:10,429 INFO L325 Elim1Store]: treesize reduction 11, result has 93.9 percent of original size [2025-04-13 22:21:10,429 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 195 treesize of output 239 [2025-04-13 22:21:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:21:11,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197214344] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:11,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:11,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 30 [2025-04-13 22:21:11,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322408956] [2025-04-13 22:21:11,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:11,471 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:21:11,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:11,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:21:11,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:21:11,472 INFO L87 Difference]: Start difference. First operand 648 states and 2015 transitions. Second operand has 31 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 31 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:16,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:16,441 INFO L93 Difference]: Finished difference Result 803 states and 2375 transitions. [2025-04-13 22:21:16,441 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 22:21:16,441 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 31 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:21:16,441 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:16,443 INFO L225 Difference]: With dead ends: 803 [2025-04-13 22:21:16,443 INFO L226 Difference]: Without dead ends: 759 [2025-04-13 22:21:16,444 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1407 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=584, Invalid=4386, Unknown=0, NotChecked=0, Total=4970 [2025-04-13 22:21:16,444 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 144 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:16,444 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 0 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:21:16,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2025-04-13 22:21:18,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 666. [2025-04-13 22:21:18,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 665 states have (on average 3.0977443609022557) internal successors, (2060), 665 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 2060 transitions. [2025-04-13 22:21:18,005 INFO L79 Accepts]: Start accepts. Automaton has 666 states and 2060 transitions. Word has length 30 [2025-04-13 22:21:18,005 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:18,005 INFO L485 AbstractCegarLoop]: Abstraction has 666 states and 2060 transitions. [2025-04-13 22:21:18,005 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 31 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:18,005 INFO L278 IsEmpty]: Start isEmpty. Operand 666 states and 2060 transitions. [2025-04-13 22:21:18,005 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:21:18,005 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:18,006 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:18,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Ended with exit code 0 [2025-04-13 22:21:18,206 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 121 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable129 [2025-04-13 22:21:18,206 INFO L403 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:18,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:18,206 INFO L85 PathProgramCache]: Analyzing trace with hash 337605870, now seen corresponding path program 112 times [2025-04-13 22:21:18,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:18,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074173378] [2025-04-13 22:21:18,206 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:21:18,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:18,219 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:21:18,224 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 22:21:18,224 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:21:18,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:18,447 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:21:18,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:18,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074173378] [2025-04-13 22:21:18,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074173378] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:18,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558659192] [2025-04-13 22:21:18,447 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:21:18,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:18,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:18,449 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:21:18,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2025-04-13 22:21:18,833 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:21:18,842 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 22:21:18,842 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:21:18,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:18,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:21:18,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:19,033 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:21:19,033 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:21:19,054 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:21:19,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:19,194 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:19,195 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 197 [2025-04-13 22:21:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:21:19,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558659192] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:19,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:19,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-04-13 22:21:19,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084549527] [2025-04-13 22:21:19,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:19,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:21:19,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:19,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:21:19,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:21:19,639 INFO L87 Difference]: Start difference. First operand 666 states and 2060 transitions. Second operand has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 28 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:23,359 INFO L93 Difference]: Finished difference Result 803 states and 2403 transitions. [2025-04-13 22:21:23,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 22:21:23,359 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 28 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:21:23,359 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:23,361 INFO L225 Difference]: With dead ends: 803 [2025-04-13 22:21:23,361 INFO L226 Difference]: Without dead ends: 771 [2025-04-13 22:21:23,361 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=298, Invalid=2782, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 22:21:23,361 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:23,362 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:21:23,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-04-13 22:21:24,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 674. [2025-04-13 22:21:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 673 states have (on average 3.099554234769688) internal successors, (2086), 673 states have internal predecessors, (2086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:24,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 2086 transitions. [2025-04-13 22:21:24,985 INFO L79 Accepts]: Start accepts. Automaton has 674 states and 2086 transitions. Word has length 30 [2025-04-13 22:21:24,986 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:24,986 INFO L485 AbstractCegarLoop]: Abstraction has 674 states and 2086 transitions. [2025-04-13 22:21:24,986 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 28 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:24,986 INFO L278 IsEmpty]: Start isEmpty. Operand 674 states and 2086 transitions. [2025-04-13 22:21:24,986 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:21:24,986 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:24,986 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:24,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Ended with exit code 0 [2025-04-13 22:21:25,187 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,122 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:25,187 INFO L403 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:25,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:25,187 INFO L85 PathProgramCache]: Analyzing trace with hash 389269230, now seen corresponding path program 113 times [2025-04-13 22:21:25,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:25,187 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797712345] [2025-04-13 22:21:25,187 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:21:25,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:25,200 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:21:25,215 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:21:25,215 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:21:25,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:25,963 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:21:25,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:25,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797712345] [2025-04-13 22:21:25,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797712345] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:25,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102885028] [2025-04-13 22:21:25,964 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:21:25,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:25,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:25,966 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:21:25,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2025-04-13 22:21:26,365 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:21:26,446 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:21:26,446 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:21:26,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:26,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 22:21:26,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:26,767 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:21:26,768 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 22:21:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:21:26,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:26,920 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:26,921 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 22:21:28,002 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:21:28,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102885028] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:28,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:28,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 11] total 44 [2025-04-13 22:21:28,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913399917] [2025-04-13 22:21:28,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:28,002 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-13 22:21:28,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:28,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-13 22:21:28,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1827, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:21:28,003 INFO L87 Difference]: Start difference. First operand 674 states and 2086 transitions. Second operand has 45 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 45 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:32,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:32,096 INFO L93 Difference]: Finished difference Result 745 states and 2227 transitions. [2025-04-13 22:21:32,096 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 22:21:32,097 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 45 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:21:32,097 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:32,099 INFO L225 Difference]: With dead ends: 745 [2025-04-13 22:21:32,099 INFO L226 Difference]: Without dead ends: 721 [2025-04-13 22:21:32,099 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1231 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=570, Invalid=6236, Unknown=0, NotChecked=0, Total=6806 [2025-04-13 22:21:32,099 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1630 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:32,099 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 0 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1630 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:21:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-04-13 22:21:33,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 678. [2025-04-13 22:21:33,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 677 states have (on average 3.1019202363367797) internal successors, (2100), 677 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:33,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 2100 transitions. [2025-04-13 22:21:33,719 INFO L79 Accepts]: Start accepts. Automaton has 678 states and 2100 transitions. Word has length 30 [2025-04-13 22:21:33,719 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:33,719 INFO L485 AbstractCegarLoop]: Abstraction has 678 states and 2100 transitions. [2025-04-13 22:21:33,719 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 45 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:33,719 INFO L278 IsEmpty]: Start isEmpty. Operand 678 states and 2100 transitions. [2025-04-13 22:21:33,720 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:21:33,720 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:33,720 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:33,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Ended with exit code 0 [2025-04-13 22:21:33,920 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131,123 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:33,920 INFO L403 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:33,921 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:33,921 INFO L85 PathProgramCache]: Analyzing trace with hash -826522526, now seen corresponding path program 114 times [2025-04-13 22:21:33,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:33,921 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031444356] [2025-04-13 22:21:33,921 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:21:33,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:33,933 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:21:33,952 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:21:33,953 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:21:33,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:21:34,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:34,466 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031444356] [2025-04-13 22:21:34,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031444356] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:34,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136036791] [2025-04-13 22:21:34,468 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:21:34,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:34,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:34,471 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:21:34,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2025-04-13 22:21:34,862 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:21:34,917 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:21:34,917 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:21:34,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:34,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:21:34,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:35,101 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:21:35,101 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:21:35,120 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:21:35,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:35,229 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:35,229 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 191 [2025-04-13 22:21:35,759 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:21:35,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136036791] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:35,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:35,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 29 [2025-04-13 22:21:35,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642013479] [2025-04-13 22:21:35,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:35,760 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:21:35,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:35,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:21:35,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:21:35,760 INFO L87 Difference]: Start difference. First operand 678 states and 2100 transitions. Second operand has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:39,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:39,677 INFO L93 Difference]: Finished difference Result 809 states and 2413 transitions. [2025-04-13 22:21:39,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 22:21:39,678 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:21:39,678 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:39,680 INFO L225 Difference]: With dead ends: 809 [2025-04-13 22:21:39,680 INFO L226 Difference]: Without dead ends: 790 [2025-04-13 22:21:39,680 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=404, Invalid=3256, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 22:21:39,680 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 139 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:39,680 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 0 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:21:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-04-13 22:21:41,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 698. [2025-04-13 22:21:41,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 3.116212338593974) internal successors, (2172), 697 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:41,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2172 transitions. [2025-04-13 22:21:41,358 INFO L79 Accepts]: Start accepts. Automaton has 698 states and 2172 transitions. Word has length 30 [2025-04-13 22:21:41,358 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:41,358 INFO L485 AbstractCegarLoop]: Abstraction has 698 states and 2172 transitions. [2025-04-13 22:21:41,358 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:41,358 INFO L278 IsEmpty]: Start isEmpty. Operand 698 states and 2172 transitions. [2025-04-13 22:21:41,358 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:21:41,358 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:41,358 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:41,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Ended with exit code 0 [2025-04-13 22:21:41,559 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132,124 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:41,559 INFO L403 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:41,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:41,559 INFO L85 PathProgramCache]: Analyzing trace with hash -824014316, now seen corresponding path program 115 times [2025-04-13 22:21:41,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:41,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436529165] [2025-04-13 22:21:41,560 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:21:41,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:41,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:21:41,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:21:41,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:21:41,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:42,237 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:21:42,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:42,238 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436529165] [2025-04-13 22:21:42,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436529165] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:42,238 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274898817] [2025-04-13 22:21:42,238 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:21:42,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:42,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:42,240 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:21:42,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2025-04-13 22:21:42,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:21:42,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:21:42,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:21:42,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:42,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:21:42,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:42,865 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:21:42,866 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:21:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:21:42,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:43,017 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:43,018 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 226 treesize of output 222 [2025-04-13 22:21:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:21:43,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274898817] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:43,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:43,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 39 [2025-04-13 22:21:43,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053324489] [2025-04-13 22:21:43,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:43,635 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 22:21:43,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:43,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 22:21:43,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1413, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:21:43,635 INFO L87 Difference]: Start difference. First operand 698 states and 2172 transitions. Second operand has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:48,503 INFO L93 Difference]: Finished difference Result 828 states and 2442 transitions. [2025-04-13 22:21:48,503 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 22:21:48,503 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:21:48,503 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:48,505 INFO L225 Difference]: With dead ends: 828 [2025-04-13 22:21:48,505 INFO L226 Difference]: Without dead ends: 804 [2025-04-13 22:21:48,505 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2297 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=782, Invalid=7408, Unknown=0, NotChecked=0, Total=8190 [2025-04-13 22:21:48,506 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 223 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:48,506 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 0 Invalid, 1873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1828 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:21:48,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-04-13 22:21:50,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 696. [2025-04-13 22:21:50,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 3.1093525179856116) internal successors, (2161), 695 states have internal predecessors, (2161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:50,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 2161 transitions. [2025-04-13 22:21:50,196 INFO L79 Accepts]: Start accepts. Automaton has 696 states and 2161 transitions. Word has length 30 [2025-04-13 22:21:50,196 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:50,196 INFO L485 AbstractCegarLoop]: Abstraction has 696 states and 2161 transitions. [2025-04-13 22:21:50,196 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:50,196 INFO L278 IsEmpty]: Start isEmpty. Operand 696 states and 2161 transitions. [2025-04-13 22:21:50,197 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:21:50,197 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:50,197 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:50,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Ended with exit code 0 [2025-04-13 22:21:50,397 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 125 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable133 [2025-04-13 22:21:50,398 INFO L403 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:50,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:50,398 INFO L85 PathProgramCache]: Analyzing trace with hash -713191796, now seen corresponding path program 116 times [2025-04-13 22:21:50,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:50,398 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75643247] [2025-04-13 22:21:50,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:21:50,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:50,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:21:50,423 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:21:50,423 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:21:50,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:50,869 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:21:50,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:50,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75643247] [2025-04-13 22:21:50,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75643247] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:50,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839581385] [2025-04-13 22:21:50,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:21:50,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:50,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:50,871 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:21:50,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2025-04-13 22:21:51,272 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:21:51,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:21:51,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:21:51,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:51,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:21:51,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:51,676 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:21:51,676 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:21:51,702 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:21:51,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:51,838 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:51,838 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 22:21:52,644 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:21:52,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839581385] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:52,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:52,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 11] total 39 [2025-04-13 22:21:52,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81810741] [2025-04-13 22:21:52,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:52,644 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 22:21:52,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:52,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 22:21:52,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1386, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:21:52,645 INFO L87 Difference]: Start difference. First operand 696 states and 2161 transitions. Second operand has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:57,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:57,517 INFO L93 Difference]: Finished difference Result 841 states and 2461 transitions. [2025-04-13 22:21:57,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-13 22:21:57,518 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:21:57,518 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:57,520 INFO L225 Difference]: With dead ends: 841 [2025-04-13 22:21:57,520 INFO L226 Difference]: Without dead ends: 807 [2025-04-13 22:21:57,520 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2888 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=821, Invalid=7551, Unknown=0, NotChecked=0, Total=8372 [2025-04-13 22:21:57,521 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 259 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:57,521 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 0 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:21:57,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2025-04-13 22:21:59,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 698. [2025-04-13 22:21:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 3.116212338593974) internal successors, (2172), 697 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2172 transitions. [2025-04-13 22:21:59,241 INFO L79 Accepts]: Start accepts. Automaton has 698 states and 2172 transitions. Word has length 30 [2025-04-13 22:21:59,241 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:59,241 INFO L485 AbstractCegarLoop]: Abstraction has 698 states and 2172 transitions. [2025-04-13 22:21:59,241 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:59,241 INFO L278 IsEmpty]: Start isEmpty. Operand 698 states and 2172 transitions. [2025-04-13 22:21:59,241 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:21:59,241 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:59,242 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:59,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Ended with exit code 0 [2025-04-13 22:21:59,442 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 126 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable134 [2025-04-13 22:21:59,442 INFO L403 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:59,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:59,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1572660972, now seen corresponding path program 117 times [2025-04-13 22:21:59,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:59,442 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639995417] [2025-04-13 22:21:59,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:21:59,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:59,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:21:59,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 22:21:59,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:21:59,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:59,876 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:21:59,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:59,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639995417] [2025-04-13 22:21:59,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639995417] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:59,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738312621] [2025-04-13 22:21:59,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:21:59,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:59,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:59,878 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:21:59,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2025-04-13 22:22:00,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:22:00,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 22:22:00,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:22:00,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:00,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:22:00,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:00,637 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:22:00,637 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:22:00,663 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:22:00,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:00,828 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:22:00,829 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 22:22:01,734 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:22:01,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738312621] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:01,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:01,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 36 [2025-04-13 22:22:01,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147309236] [2025-04-13 22:22:01,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:01,734 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:22:01,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:01,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:22:01,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1176, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:22:01,735 INFO L87 Difference]: Start difference. First operand 698 states and 2172 transitions. Second operand has 37 states, 36 states have (on average 1.75) internal successors, (63), 37 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:06,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:06,366 INFO L93 Difference]: Finished difference Result 810 states and 2416 transitions. [2025-04-13 22:22:06,366 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 22:22:06,366 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.75) internal successors, (63), 37 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:22:06,366 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:06,368 INFO L225 Difference]: With dead ends: 810 [2025-04-13 22:22:06,369 INFO L226 Difference]: Without dead ends: 778 [2025-04-13 22:22:06,369 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=712, Invalid=4690, Unknown=0, NotChecked=0, Total=5402 [2025-04-13 22:22:06,369 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 202 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:06,369 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 0 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:22:06,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2025-04-13 22:22:08,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 688. [2025-04-13 22:22:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 3.1048034934497815) internal successors, (2133), 687 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 2133 transitions. [2025-04-13 22:22:08,055 INFO L79 Accepts]: Start accepts. Automaton has 688 states and 2133 transitions. Word has length 30 [2025-04-13 22:22:08,055 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:08,055 INFO L485 AbstractCegarLoop]: Abstraction has 688 states and 2133 transitions. [2025-04-13 22:22:08,055 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.75) internal successors, (63), 37 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:08,055 INFO L278 IsEmpty]: Start isEmpty. Operand 688 states and 2133 transitions. [2025-04-13 22:22:08,056 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:22:08,056 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:08,056 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:22:08,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Forceful destruction successful, exit code 0 [2025-04-13 22:22:08,256 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 127 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2025-04-13 22:22:08,256 INFO L403 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:08,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:08,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1848565644, now seen corresponding path program 118 times [2025-04-13 22:22:08,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:08,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966313849] [2025-04-13 22:22:08,257 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:22:08,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:08,269 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:22:08,272 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 22:22:08,272 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:22:08,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:08,521 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:22:08,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:08,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966313849] [2025-04-13 22:22:08,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966313849] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:08,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403759729] [2025-04-13 22:22:08,521 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:22:08,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:08,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:08,523 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:22:08,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2025-04-13 22:22:08,919 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:22:08,928 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 22:22:08,928 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:22:08,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:08,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:22:08,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:09,117 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:22:09,117 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:22:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:22:09,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:09,345 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:22:09,346 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 22:22:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:22:09,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403759729] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:09,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:09,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2025-04-13 22:22:09,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560598818] [2025-04-13 22:22:09,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:09,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:22:09,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:09,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:22:09,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:22:09,802 INFO L87 Difference]: Start difference. First operand 688 states and 2133 transitions. Second operand has 29 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:13,503 INFO L93 Difference]: Finished difference Result 746 states and 2268 transitions. [2025-04-13 22:22:13,503 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:22:13,503 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:22:13,503 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:13,505 INFO L225 Difference]: With dead ends: 746 [2025-04-13 22:22:13,505 INFO L226 Difference]: Without dead ends: 723 [2025-04-13 22:22:13,506 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=240, Invalid=2016, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:22:13,506 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:13,506 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:22:13,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-04-13 22:22:15,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 690. [2025-04-13 22:22:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 689 states have (on average 3.0972423802612483) internal successors, (2134), 689 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:15,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 2134 transitions. [2025-04-13 22:22:15,194 INFO L79 Accepts]: Start accepts. Automaton has 690 states and 2134 transitions. Word has length 30 [2025-04-13 22:22:15,194 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:15,194 INFO L485 AbstractCegarLoop]: Abstraction has 690 states and 2134 transitions. [2025-04-13 22:22:15,194 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:15,194 INFO L278 IsEmpty]: Start isEmpty. Operand 690 states and 2134 transitions. [2025-04-13 22:22:15,195 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:22:15,195 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:15,195 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:22:15,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Ended with exit code 0 [2025-04-13 22:22:15,395 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 128 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable136 [2025-04-13 22:22:15,395 INFO L403 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:15,396 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:15,396 INFO L85 PathProgramCache]: Analyzing trace with hash -41658332, now seen corresponding path program 119 times [2025-04-13 22:22:15,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:15,396 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799689791] [2025-04-13 22:22:15,396 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:22:15,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:15,408 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:22:15,424 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:22:15,424 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:22:15,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 22:22:15,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:15,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799689791] [2025-04-13 22:22:15,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799689791] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:15,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314684228] [2025-04-13 22:22:15,909 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:22:15,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:15,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:15,911 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:22:15,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2025-04-13 22:22:16,314 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:22:16,385 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:22:16,386 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:22:16,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:16,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:22:16,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:16,657 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:22:16,658 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 22:22:16,683 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:22:16,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:16,898 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:22:16,898 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 193 [2025-04-13 22:22:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:22:17,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314684228] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:17,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:17,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 11] total 35 [2025-04-13 22:22:17,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497326217] [2025-04-13 22:22:17,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:17,200 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 22:22:17,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:17,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 22:22:17,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1142, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:22:17,200 INFO L87 Difference]: Start difference. First operand 690 states and 2134 transitions. Second operand has 36 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 36 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:22,049 INFO L93 Difference]: Finished difference Result 803 states and 2383 transitions. [2025-04-13 22:22:22,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 22:22:22,050 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 36 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:22:22,050 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:22,052 INFO L225 Difference]: With dead ends: 803 [2025-04-13 22:22:22,052 INFO L226 Difference]: Without dead ends: 753 [2025-04-13 22:22:22,052 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=463, Invalid=4939, Unknown=0, NotChecked=0, Total=5402 [2025-04-13 22:22:22,052 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 161 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2107 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:22,052 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 0 Invalid, 2132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2107 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:22:22,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2025-04-13 22:22:23,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 701. [2025-04-13 22:22:23,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 700 states have (on average 3.087142857142857) internal successors, (2161), 700 states have internal predecessors, (2161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:23,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 2161 transitions. [2025-04-13 22:22:23,852 INFO L79 Accepts]: Start accepts. Automaton has 701 states and 2161 transitions. Word has length 30 [2025-04-13 22:22:23,853 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:23,853 INFO L485 AbstractCegarLoop]: Abstraction has 701 states and 2161 transitions. [2025-04-13 22:22:23,853 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 36 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:23,853 INFO L278 IsEmpty]: Start isEmpty. Operand 701 states and 2161 transitions. [2025-04-13 22:22:23,853 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:22:23,853 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:23,853 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:22:23,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Ended with exit code 0 [2025-04-13 22:22:24,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 129 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable137 [2025-04-13 22:22:24,054 INFO L403 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:24,054 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:24,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1475610212, now seen corresponding path program 120 times [2025-04-13 22:22:24,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:24,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459905269] [2025-04-13 22:22:24,054 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:22:24,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:24,067 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:22:24,091 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:22:24,091 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:22:24,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:24,505 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:22:24,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:24,506 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459905269] [2025-04-13 22:22:24,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459905269] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:24,506 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493151456] [2025-04-13 22:22:24,506 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:22:24,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:24,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:24,508 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:22:24,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2025-04-13 22:22:24,907 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:22:24,977 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:22:24,977 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:22:24,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:24,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:22:24,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:25,229 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:22:25,229 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:22:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:22:25,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:25,807 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-13 22:22:25,807 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 195 treesize of output 233 [2025-04-13 22:22:27,848 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:22:27,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493151456] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:27,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:27,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 31 [2025-04-13 22:22:27,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742264160] [2025-04-13 22:22:27,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:27,849 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:22:27,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:27,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:22:27,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=858, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:22:27,849 INFO L87 Difference]: Start difference. First operand 701 states and 2161 transitions. Second operand has 32 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:35,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:35,385 INFO L93 Difference]: Finished difference Result 903 states and 2623 transitions. [2025-04-13 22:22:35,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-04-13 22:22:35,385 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:22:35,385 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:35,388 INFO L225 Difference]: With dead ends: 903 [2025-04-13 22:22:35,388 INFO L226 Difference]: Without dead ends: 867 [2025-04-13 22:22:35,388 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2708 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=987, Invalid=7385, Unknown=0, NotChecked=0, Total=8372 [2025-04-13 22:22:35,388 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 221 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:35,388 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 0 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1451 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:22:35,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-04-13 22:22:37,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 739. [2025-04-13 22:22:37,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 3.105691056910569) internal successors, (2292), 738 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:37,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 2292 transitions. [2025-04-13 22:22:37,327 INFO L79 Accepts]: Start accepts. Automaton has 739 states and 2292 transitions. Word has length 30 [2025-04-13 22:22:37,327 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:37,327 INFO L485 AbstractCegarLoop]: Abstraction has 739 states and 2292 transitions. [2025-04-13 22:22:37,327 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:37,327 INFO L278 IsEmpty]: Start isEmpty. Operand 739 states and 2292 transitions. [2025-04-13 22:22:37,328 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:22:37,328 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:37,328 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:22:37,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Ended with exit code 0 [2025-04-13 22:22:37,528 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 130 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable138 [2025-04-13 22:22:37,529 INFO L403 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:37,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:37,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1524765362, now seen corresponding path program 121 times [2025-04-13 22:22:37,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:37,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366082720] [2025-04-13 22:22:37,529 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:22:37,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:37,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:22:37,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:22:37,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:22:37,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:22:38,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:38,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366082720] [2025-04-13 22:22:38,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366082720] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:38,120 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355868161] [2025-04-13 22:22:38,120 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:22:38,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:38,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:38,121 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:22:38,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2025-04-13 22:22:38,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:22:38,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:22:38,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:22:38,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:38,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:22:38,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:38,764 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:22:38,764 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:22:38,787 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:22:38,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:38,924 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:22:38,924 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 210 treesize of output 206 [2025-04-13 22:22:39,530 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:22:39,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355868161] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:39,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:39,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 39 [2025-04-13 22:22:39,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739020853] [2025-04-13 22:22:39,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:39,531 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 22:22:39,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:39,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 22:22:39,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1414, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:22:39,531 INFO L87 Difference]: Start difference. First operand 739 states and 2292 transitions. Second operand has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:45,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:45,128 INFO L93 Difference]: Finished difference Result 912 states and 2656 transitions. [2025-04-13 22:22:45,128 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-13 22:22:45,128 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:22:45,128 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:45,130 INFO L225 Difference]: With dead ends: 912 [2025-04-13 22:22:45,130 INFO L226 Difference]: Without dead ends: 887 [2025-04-13 22:22:45,131 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2501 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=824, Invalid=7918, Unknown=0, NotChecked=0, Total=8742 [2025-04-13 22:22:45,131 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 233 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:45,131 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 0 Invalid, 2035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:22:45,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-04-13 22:22:47,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 751. [2025-04-13 22:22:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 750 states have (on average 3.12) internal successors, (2340), 750 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 2340 transitions. [2025-04-13 22:22:47,088 INFO L79 Accepts]: Start accepts. Automaton has 751 states and 2340 transitions. Word has length 30 [2025-04-13 22:22:47,088 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:47,088 INFO L485 AbstractCegarLoop]: Abstraction has 751 states and 2340 transitions. [2025-04-13 22:22:47,088 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:47,089 INFO L278 IsEmpty]: Start isEmpty. Operand 751 states and 2340 transitions. [2025-04-13 22:22:47,089 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:22:47,089 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:47,089 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:22:47,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Forceful destruction successful, exit code 0 [2025-04-13 22:22:47,290 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139,131 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:47,290 INFO L403 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:47,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:47,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1527273572, now seen corresponding path program 122 times [2025-04-13 22:22:47,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:47,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228853871] [2025-04-13 22:22:47,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:22:47,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:47,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:22:47,313 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:22:47,313 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:22:47,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:47,717 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:22:47,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:47,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228853871] [2025-04-13 22:22:47,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228853871] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:47,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574850022] [2025-04-13 22:22:47,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:22:47,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:47,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:47,719 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:22:47,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2025-04-13 22:22:48,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:22:48,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:22:48,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:22:48,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:48,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 22:22:48,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:48,520 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:22:48,521 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:22:48,545 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:22:48,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:49,129 INFO L325 Elim1Store]: treesize reduction 11, result has 93.9 percent of original size [2025-04-13 22:22:49,129 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 209 treesize of output 253 [2025-04-13 22:22:50,471 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:22:50,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574850022] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:50,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:50,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 11] total 39 [2025-04-13 22:22:50,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272330] [2025-04-13 22:22:50,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:50,471 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 22:22:50,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:50,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 22:22:50,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1374, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:22:50,472 INFO L87 Difference]: Start difference. First operand 751 states and 2340 transitions. Second operand has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:57,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:57,852 INFO L93 Difference]: Finished difference Result 953 states and 2757 transitions. [2025-04-13 22:22:57,852 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 22:22:57,852 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:22:57,852 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:57,855 INFO L225 Difference]: With dead ends: 953 [2025-04-13 22:22:57,855 INFO L226 Difference]: Without dead ends: 923 [2025-04-13 22:22:57,855 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3129 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=932, Invalid=8188, Unknown=0, NotChecked=0, Total=9120 [2025-04-13 22:22:57,855 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 257 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:57,855 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 0 Invalid, 1874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1808 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:22:57,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-04-13 22:22:59,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 755. [2025-04-13 22:22:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 754 states have (on average 3.114058355437666) internal successors, (2348), 754 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 2348 transitions. [2025-04-13 22:22:59,882 INFO L79 Accepts]: Start accepts. Automaton has 755 states and 2348 transitions. Word has length 30 [2025-04-13 22:22:59,882 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:59,882 INFO L485 AbstractCegarLoop]: Abstraction has 755 states and 2348 transitions. [2025-04-13 22:22:59,882 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:59,882 INFO L278 IsEmpty]: Start isEmpty. Operand 755 states and 2348 transitions. [2025-04-13 22:22:59,883 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:22:59,883 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:59,883 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:22:59,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Ended with exit code 0 [2025-04-13 22:23:00,083 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,132 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:00,084 INFO L403 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:00,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:00,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1980670372, now seen corresponding path program 123 times [2025-04-13 22:23:00,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:00,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978624486] [2025-04-13 22:23:00,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:23:00,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:00,097 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:23:00,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:23:00,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:23:00,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:01,091 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:23:01,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:01,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978624486] [2025-04-13 22:23:01,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978624486] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:01,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887991973] [2025-04-13 22:23:01,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:23:01,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:01,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:01,093 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:23:01,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2025-04-13 22:23:01,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:23:01,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:23:01,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:23:01,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:01,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 22:23:01,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:01,986 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:23:01,986 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:23:02,010 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:23:02,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:02,301 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-13 22:23:02,302 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 234 treesize of output 296 [2025-04-13 22:23:04,457 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:23:04,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887991973] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:04,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:04,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 11] total 40 [2025-04-13 22:23:04,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473695494] [2025-04-13 22:23:04,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:04,458 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 22:23:04,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:04,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 22:23:04,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1448, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:23:04,458 INFO L87 Difference]: Start difference. First operand 755 states and 2348 transitions. Second operand has 41 states, 40 states have (on average 1.7) internal successors, (68), 41 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:12,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:12,072 INFO L93 Difference]: Finished difference Result 947 states and 2941 transitions. [2025-04-13 22:23:12,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 22:23:12,072 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.7) internal successors, (68), 41 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:23:12,072 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:12,074 INFO L225 Difference]: With dead ends: 947 [2025-04-13 22:23:12,074 INFO L226 Difference]: Without dead ends: 919 [2025-04-13 22:23:12,075 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2725 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1180, Invalid=8326, Unknown=0, NotChecked=0, Total=9506 [2025-04-13 22:23:12,075 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 213 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:12,075 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 0 Invalid, 1753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1650 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:23:12,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2025-04-13 22:23:14,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 827. [2025-04-13 22:23:14,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 826 states have (on average 3.196125907990315) internal successors, (2640), 826 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 2640 transitions. [2025-04-13 22:23:14,303 INFO L79 Accepts]: Start accepts. Automaton has 827 states and 2640 transitions. Word has length 30 [2025-04-13 22:23:14,303 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:14,303 INFO L485 AbstractCegarLoop]: Abstraction has 827 states and 2640 transitions. [2025-04-13 22:23:14,303 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.7) internal successors, (68), 41 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:14,303 INFO L278 IsEmpty]: Start isEmpty. Operand 827 states and 2640 transitions. [2025-04-13 22:23:14,304 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:23:14,304 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:14,304 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:23:14,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Forceful destruction successful, exit code 0 [2025-04-13 22:23:14,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141,133 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:14,504 INFO L403 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:14,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:14,505 INFO L85 PathProgramCache]: Analyzing trace with hash 311481816, now seen corresponding path program 124 times [2025-04-13 22:23:14,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:14,505 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943398209] [2025-04-13 22:23:14,505 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:23:14,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:14,517 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:23:14,521 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 22:23:14,521 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:23:14,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:23:14,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:14,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943398209] [2025-04-13 22:23:14,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943398209] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:14,750 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328443488] [2025-04-13 22:23:14,750 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:23:14,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:14,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:14,751 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:23:14,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Waiting until timeout for monitored process [2025-04-13 22:23:15,174 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:23:15,183 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 22:23:15,183 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:23:15,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:15,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:23:15,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:15,356 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:23:15,356 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:23:15,376 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:23:15,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:15,502 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:15,502 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 191 [2025-04-13 22:23:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:23:16,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328443488] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:16,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:16,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2025-04-13 22:23:16,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234176144] [2025-04-13 22:23:16,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:16,009 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:23:16,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:16,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:23:16,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:23:16,009 INFO L87 Difference]: Start difference. First operand 827 states and 2640 transitions. Second operand has 27 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:20,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:20,637 INFO L93 Difference]: Finished difference Result 963 states and 2951 transitions. [2025-04-13 22:23:20,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 22:23:20,637 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:23:20,637 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:20,639 INFO L225 Difference]: With dead ends: 963 [2025-04-13 22:23:20,639 INFO L226 Difference]: Without dead ends: 941 [2025-04-13 22:23:20,640 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=337, Invalid=2743, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 22:23:20,640 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 153 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:20,640 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 0 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:23:20,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-04-13 22:23:22,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 837. [2025-04-13 22:23:22,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 3.202153110047847) internal successors, (2677), 836 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 2677 transitions. [2025-04-13 22:23:22,939 INFO L79 Accepts]: Start accepts. Automaton has 837 states and 2677 transitions. Word has length 30 [2025-04-13 22:23:22,939 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:22,939 INFO L485 AbstractCegarLoop]: Abstraction has 837 states and 2677 transitions. [2025-04-13 22:23:22,939 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:22,939 INFO L278 IsEmpty]: Start isEmpty. Operand 837 states and 2677 transitions. [2025-04-13 22:23:22,940 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:23:22,940 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:22,940 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:23:22,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Ended with exit code 0 [2025-04-13 22:23:23,140 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142,134 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:23,141 INFO L403 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:23,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:23,141 INFO L85 PathProgramCache]: Analyzing trace with hash 313990026, now seen corresponding path program 125 times [2025-04-13 22:23:23,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:23,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711490682] [2025-04-13 22:23:23,141 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:23:23,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:23,153 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:23:23,175 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:23:23,175 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:23:23,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 22:23:23,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:23,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711490682] [2025-04-13 22:23:23,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711490682] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:23,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351037452] [2025-04-13 22:23:23,671 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:23:23,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:23,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:23,673 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:23:23,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Waiting until timeout for monitored process [2025-04-13 22:23:24,093 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:23:24,180 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:23:24,180 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:23:24,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:24,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:23:24,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:24,468 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:23:24,469 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:23:24,495 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:23:24,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:24,606 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:24,607 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 22:23:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:23:25,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351037452] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:25,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:25,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 38 [2025-04-13 22:23:25,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528033553] [2025-04-13 22:23:25,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:25,207 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 22:23:25,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:25,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 22:23:25,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:23:25,208 INFO L87 Difference]: Start difference. First operand 837 states and 2677 transitions. Second operand has 39 states, 38 states have (on average 1.763157894736842) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:30,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:30,434 INFO L93 Difference]: Finished difference Result 952 states and 2897 transitions. [2025-04-13 22:23:30,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 22:23:30,434 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.763157894736842) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:23:30,434 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:30,437 INFO L225 Difference]: With dead ends: 952 [2025-04-13 22:23:30,437 INFO L226 Difference]: Without dead ends: 920 [2025-04-13 22:23:30,437 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=577, Invalid=5743, Unknown=0, NotChecked=0, Total=6320 [2025-04-13 22:23:30,437 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 0 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.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:30,437 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 0 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:23:30,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2025-04-13 22:23:32,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 841. [2025-04-13 22:23:32,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 3.2011904761904764) internal successors, (2689), 840 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:32,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 2689 transitions. [2025-04-13 22:23:32,768 INFO L79 Accepts]: Start accepts. Automaton has 841 states and 2689 transitions. Word has length 30 [2025-04-13 22:23:32,769 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:32,769 INFO L485 AbstractCegarLoop]: Abstraction has 841 states and 2689 transitions. [2025-04-13 22:23:32,769 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.763157894736842) internal successors, (67), 39 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:32,769 INFO L278 IsEmpty]: Start isEmpty. Operand 841 states and 2689 transitions. [2025-04-13 22:23:32,770 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:23:32,770 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:32,770 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:23:32,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Forceful destruction successful, exit code 0 [2025-04-13 22:23:32,970 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143,135 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:32,970 INFO L403 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:32,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:32,970 INFO L85 PathProgramCache]: Analyzing trace with hash 424812546, now seen corresponding path program 126 times [2025-04-13 22:23:32,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:32,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516519384] [2025-04-13 22:23:32,971 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:23:32,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:32,983 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:23:33,001 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:23:33,002 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:23:33,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:33,508 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:23:33,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:33,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516519384] [2025-04-13 22:23:33,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516519384] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:33,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780139809] [2025-04-13 22:23:33,508 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:23:33,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:33,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:33,510 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:23:33,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Waiting until timeout for monitored process [2025-04-13 22:23:33,930 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:23:33,956 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:23:33,956 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:23:33,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:33,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:23:33,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:34,290 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:23:34,291 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:23:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:23:34,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:34,458 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:34,459 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 22:23:35,267 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:23:35,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780139809] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:35,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:35,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 11] total 39 [2025-04-13 22:23:35,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442640216] [2025-04-13 22:23:35,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:35,267 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 22:23:35,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:35,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 22:23:35,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1422, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:23:35,268 INFO L87 Difference]: Start difference. First operand 841 states and 2689 transitions. Second operand has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:40,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:40,709 INFO L93 Difference]: Finished difference Result 952 states and 2911 transitions. [2025-04-13 22:23:40,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 22:23:40,709 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:23:40,709 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:40,712 INFO L225 Difference]: With dead ends: 952 [2025-04-13 22:23:40,712 INFO L226 Difference]: Without dead ends: 930 [2025-04-13 22:23:40,712 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1678 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=518, Invalid=5644, Unknown=0, NotChecked=0, Total=6162 [2025-04-13 22:23:40,712 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:40,713 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 0 Invalid, 1484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:23:40,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-04-13 22:23:42,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 841. [2025-04-13 22:23:42,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 3.198809523809524) internal successors, (2687), 840 states have internal predecessors, (2687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 2687 transitions. [2025-04-13 22:23:42,997 INFO L79 Accepts]: Start accepts. Automaton has 841 states and 2687 transitions. Word has length 30 [2025-04-13 22:23:42,997 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:42,997 INFO L485 AbstractCegarLoop]: Abstraction has 841 states and 2687 transitions. [2025-04-13 22:23:42,997 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:42,997 INFO L278 IsEmpty]: Start isEmpty. Operand 841 states and 2687 transitions. [2025-04-13 22:23:42,998 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:23:42,998 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:42,998 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:23:43,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Ended with exit code 0 [2025-04-13 22:23:43,198 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144,136 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:43,198 INFO L403 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:43,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:43,198 INFO L85 PathProgramCache]: Analyzing trace with hash -47394012, now seen corresponding path program 127 times [2025-04-13 22:23:43,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:43,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871182178] [2025-04-13 22:23:43,199 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:23:43,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:43,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:23:43,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:23:43,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:23:43,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:23:43,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:43,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871182178] [2025-04-13 22:23:43,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871182178] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:43,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416970319] [2025-04-13 22:23:43,820 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:23:43,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:43,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:43,821 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:23:43,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2025-04-13 22:23:44,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:23:44,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:23:44,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:23:44,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:44,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:23:44,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:44,516 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:23:44,516 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:23:44,538 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:23:44,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:44,719 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:44,719 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 212 [2025-04-13 22:23:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:23:45,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416970319] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:45,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:45,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 39 [2025-04-13 22:23:45,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716356817] [2025-04-13 22:23:45,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:45,347 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 22:23:45,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:45,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 22:23:45,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1411, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:23:45,347 INFO L87 Difference]: Start difference. First operand 841 states and 2687 transitions. Second operand has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:50,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:50,575 INFO L93 Difference]: Finished difference Result 948 states and 2943 transitions. [2025-04-13 22:23:50,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 22:23:50,575 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:23:50,575 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:50,578 INFO L225 Difference]: With dead ends: 948 [2025-04-13 22:23:50,578 INFO L226 Difference]: Without dead ends: 911 [2025-04-13 22:23:50,578 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1357 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=608, Invalid=4942, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 22:23:50,578 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 182 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:50,579 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 0 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:23:50,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2025-04-13 22:23:52,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 829. [2025-04-13 22:23:52,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 828 states have (on average 3.1944444444444446) internal successors, (2645), 828 states have internal predecessors, (2645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:52,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 2645 transitions. [2025-04-13 22:23:52,821 INFO L79 Accepts]: Start accepts. Automaton has 829 states and 2645 transitions. Word has length 30 [2025-04-13 22:23:52,821 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:52,821 INFO L485 AbstractCegarLoop]: Abstraction has 829 states and 2645 transitions. [2025-04-13 22:23:52,821 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:52,821 INFO L278 IsEmpty]: Start isEmpty. Operand 829 states and 2645 transitions. [2025-04-13 22:23:52,822 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:23:52,822 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:52,822 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:23:52,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Ended with exit code 0 [2025-04-13 22:23:53,022 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 137 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable145 [2025-04-13 22:23:53,022 INFO L403 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:53,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:53,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1354397554, now seen corresponding path program 128 times [2025-04-13 22:23:53,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:53,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120533590] [2025-04-13 22:23:53,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:23:53,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:53,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:23:53,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:23:53,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:23:53,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:53,505 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:23:53,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:53,506 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120533590] [2025-04-13 22:23:53,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120533590] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:53,506 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311853633] [2025-04-13 22:23:53,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:23:53,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:53,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:53,508 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:23:53,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Waiting until timeout for monitored process [2025-04-13 22:23:53,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:23:53,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:23:53,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:23:53,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:53,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:23:53,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:54,264 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:23:54,264 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:23:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:23:54,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:54,835 INFO L325 Elim1Store]: treesize reduction 11, result has 93.9 percent of original size [2025-04-13 22:23:54,836 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 195 treesize of output 239 [2025-04-13 22:23:56,417 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:23:56,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311853633] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:56,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:56,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 11] total 39 [2025-04-13 22:23:56,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406428567] [2025-04-13 22:23:56,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:56,417 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 22:23:56,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:56,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 22:23:56,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1394, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:23:56,418 INFO L87 Difference]: Start difference. First operand 829 states and 2645 transitions. Second operand has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:05,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:05,764 INFO L93 Difference]: Finished difference Result 1103 states and 3264 transitions. [2025-04-13 22:24:05,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-04-13 22:24:05,764 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:24:05,764 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:05,767 INFO L225 Difference]: With dead ends: 1103 [2025-04-13 22:24:05,767 INFO L226 Difference]: Without dead ends: 1071 [2025-04-13 22:24:05,768 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3374 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1199, Invalid=9931, Unknown=0, NotChecked=0, Total=11130 [2025-04-13 22:24:05,768 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 361 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:05,768 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 0 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:24:05,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-04-13 22:24:08,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 873. [2025-04-13 22:24:08,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 3.216743119266055) internal successors, (2805), 872 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:08,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2805 transitions. [2025-04-13 22:24:08,231 INFO L79 Accepts]: Start accepts. Automaton has 873 states and 2805 transitions. Word has length 30 [2025-04-13 22:24:08,231 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:08,231 INFO L485 AbstractCegarLoop]: Abstraction has 873 states and 2805 transitions. [2025-04-13 22:24:08,231 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:08,231 INFO L278 IsEmpty]: Start isEmpty. Operand 873 states and 2805 transitions. [2025-04-13 22:24:08,232 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:24:08,232 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:08,232 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:08,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Ended with exit code 0 [2025-04-13 22:24:08,432 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 138 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable146 [2025-04-13 22:24:08,433 INFO L403 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:08,433 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:08,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1356905764, now seen corresponding path program 129 times [2025-04-13 22:24:08,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:08,433 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472344804] [2025-04-13 22:24:08,433 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:24:08,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:08,446 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:24:08,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:24:08,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:24:08,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:09,333 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:24:09,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:09,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472344804] [2025-04-13 22:24:09,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472344804] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:09,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337741366] [2025-04-13 22:24:09,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:24:09,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:09,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:09,335 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:09,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process [2025-04-13 22:24:09,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:24:09,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:24:09,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:24:09,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:09,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:24:09,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:10,044 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:24:10,044 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:24:10,070 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:24:10,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:10,184 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:10,184 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 22:24:10,721 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:24:10,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337741366] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:10,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:10,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 11] total 36 [2025-04-13 22:24:10,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997683921] [2025-04-13 22:24:10,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:10,722 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:24:10,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:10,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:24:10,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1188, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:24:10,722 INFO L87 Difference]: Start difference. First operand 873 states and 2805 transitions. Second operand has 37 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:16,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:16,576 INFO L93 Difference]: Finished difference Result 998 states and 3075 transitions. [2025-04-13 22:24:16,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 22:24:16,576 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:24:16,576 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:16,579 INFO L225 Difference]: With dead ends: 998 [2025-04-13 22:24:16,579 INFO L226 Difference]: Without dead ends: 981 [2025-04-13 22:24:16,579 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=505, Invalid=4325, Unknown=0, NotChecked=0, Total=4830 [2025-04-13 22:24:16,579 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 142 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:16,579 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 0 Invalid, 1536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1512 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:24:16,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2025-04-13 22:24:19,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 873. [2025-04-13 22:24:19,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 3.2144495412844036) internal successors, (2803), 872 states have internal predecessors, (2803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:19,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2803 transitions. [2025-04-13 22:24:19,097 INFO L79 Accepts]: Start accepts. Automaton has 873 states and 2803 transitions. Word has length 30 [2025-04-13 22:24:19,097 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:19,097 INFO L485 AbstractCegarLoop]: Abstraction has 873 states and 2803 transitions. [2025-04-13 22:24:19,097 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 37 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:19,097 INFO L278 IsEmpty]: Start isEmpty. Operand 873 states and 2803 transitions. [2025-04-13 22:24:19,098 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:24:19,098 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:19,098 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:19,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Ended with exit code 0 [2025-04-13 22:24:19,298 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 139 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable147 [2025-04-13 22:24:19,299 INFO L403 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:19,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:19,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1467728284, now seen corresponding path program 130 times [2025-04-13 22:24:19,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:19,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835441946] [2025-04-13 22:24:19,299 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:24:19,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:19,312 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:24:19,316 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 22:24:19,316 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:24:19,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:24:19,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:19,549 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835441946] [2025-04-13 22:24:19,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835441946] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:19,549 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715900926] [2025-04-13 22:24:19,549 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:24:19,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:19,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:19,551 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:19,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Waiting until timeout for monitored process [2025-04-13 22:24:19,984 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:24:19,993 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 22:24:19,993 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:24:19,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:19,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:24:19,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:20,155 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:24:20,155 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:24:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:24:20,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:20,321 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:20,321 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 22:24:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:24:20,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715900926] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:20,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:20,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2025-04-13 22:24:20,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300236616] [2025-04-13 22:24:20,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:20,919 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:24:20,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:20,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:24:20,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:24:20,920 INFO L87 Difference]: Start difference. First operand 873 states and 2803 transitions. Second operand has 27 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:26,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:26,114 INFO L93 Difference]: Finished difference Result 983 states and 3050 transitions. [2025-04-13 22:24:26,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 22:24:26,115 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:24:26,115 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:26,117 INFO L225 Difference]: With dead ends: 983 [2025-04-13 22:24:26,117 INFO L226 Difference]: Without dead ends: 960 [2025-04-13 22:24:26,118 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=263, Invalid=2187, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:24:26,118 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:26,118 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:24:26,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-04-13 22:24:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 875. [2025-04-13 22:24:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 874 states have (on average 3.205949656750572) internal successors, (2802), 874 states have internal predecessors, (2802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 2802 transitions. [2025-04-13 22:24:28,636 INFO L79 Accepts]: Start accepts. Automaton has 875 states and 2802 transitions. Word has length 30 [2025-04-13 22:24:28,636 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:28,636 INFO L485 AbstractCegarLoop]: Abstraction has 875 states and 2802 transitions. [2025-04-13 22:24:28,637 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:28,637 INFO L278 IsEmpty]: Start isEmpty. Operand 875 states and 2802 transitions. [2025-04-13 22:24:28,638 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:24:28,638 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:28,638 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:28,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Ended with exit code 0 [2025-04-13 22:24:28,838 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 140 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable148 [2025-04-13 22:24:28,838 INFO L403 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:28,838 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:28,838 INFO L85 PathProgramCache]: Analyzing trace with hash 608259108, now seen corresponding path program 131 times [2025-04-13 22:24:28,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:28,839 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599984596] [2025-04-13 22:24:28,839 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:24:28,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:28,852 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:24:28,868 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:24:28,868 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:24:28,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 22:24:29,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:29,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599984596] [2025-04-13 22:24:29,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599984596] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:29,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344785100] [2025-04-13 22:24:29,349 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:24:29,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:29,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:29,351 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:29,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Waiting until timeout for monitored process [2025-04-13 22:24:29,790 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:24:29,843 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:24:29,843 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:24:29,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:29,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 22:24:29,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:30,119 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:24:30,119 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 22:24:30,149 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:24:30,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:30,356 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:30,356 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 22:24:30,907 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:24:30,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344785100] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:30,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:30,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 11] total 35 [2025-04-13 22:24:30,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332800385] [2025-04-13 22:24:30,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:30,908 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 22:24:30,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:30,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 22:24:30,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1146, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:24:30,908 INFO L87 Difference]: Start difference. First operand 875 states and 2802 transitions. Second operand has 36 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 36 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:36,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:36,545 INFO L93 Difference]: Finished difference Result 978 states and 3070 transitions. [2025-04-13 22:24:36,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 22:24:36,545 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 36 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:24:36,545 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:36,548 INFO L225 Difference]: With dead ends: 978 [2025-04-13 22:24:36,548 INFO L226 Difference]: Without dead ends: 957 [2025-04-13 22:24:36,548 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=428, Invalid=3994, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 22:24:36,548 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 145 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:36,548 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 0 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:24:36,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2025-04-13 22:24:39,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 877. [2025-04-13 22:24:39,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 876 states have (on average 3.199771689497717) internal successors, (2803), 876 states have internal predecessors, (2803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:39,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 2803 transitions. [2025-04-13 22:24:39,130 INFO L79 Accepts]: Start accepts. Automaton has 877 states and 2803 transitions. Word has length 30 [2025-04-13 22:24:39,130 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:39,130 INFO L485 AbstractCegarLoop]: Abstraction has 877 states and 2803 transitions. [2025-04-13 22:24:39,130 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 36 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:39,130 INFO L278 IsEmpty]: Start isEmpty. Operand 877 states and 2803 transitions. [2025-04-13 22:24:39,131 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:24:39,131 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:39,131 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:39,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Ended with exit code 0 [2025-04-13 22:24:39,331 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149,141 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:39,331 INFO L403 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:39,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:39,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2077549928, now seen corresponding path program 132 times [2025-04-13 22:24:39,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:39,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239975840] [2025-04-13 22:24:39,332 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:24:39,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:39,345 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:24:39,361 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:24:39,361 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:24:39,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:24:39,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:39,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239975840] [2025-04-13 22:24:39,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239975840] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:39,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534982774] [2025-04-13 22:24:39,898 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:24:39,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:39,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:39,900 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:39,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process [2025-04-13 22:24:40,352 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:24:40,422 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:24:40,423 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:24:40,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:40,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:24:40,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:40,812 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:24:40,813 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:24:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:24:40,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:41,065 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:41,066 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 212 [2025-04-13 22:24:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:24:42,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534982774] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:42,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:42,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 36 [2025-04-13 22:24:42,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655793100] [2025-04-13 22:24:42,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:42,342 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:24:42,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:42,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:24:42,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1216, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:24:42,343 INFO L87 Difference]: Start difference. First operand 877 states and 2803 transitions. Second operand has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:50,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:50,969 INFO L93 Difference]: Finished difference Result 1185 states and 3819 transitions. [2025-04-13 22:24:50,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 22:24:50,969 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:24:50,969 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:50,972 INFO L225 Difference]: With dead ends: 1185 [2025-04-13 22:24:50,972 INFO L226 Difference]: Without dead ends: 1099 [2025-04-13 22:24:50,973 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1912 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=859, Invalid=6451, Unknown=0, NotChecked=0, Total=7310 [2025-04-13 22:24:50,973 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 197 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2596 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:50,973 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 0 Invalid, 2716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2596 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 22:24:50,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-04-13 22:24:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 984. [2025-04-13 22:24:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 983 states have (on average 3.2807731434384535) internal successors, (3225), 983 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:53,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 3225 transitions. [2025-04-13 22:24:53,888 INFO L79 Accepts]: Start accepts. Automaton has 984 states and 3225 transitions. Word has length 30 [2025-04-13 22:24:53,888 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:53,888 INFO L485 AbstractCegarLoop]: Abstraction has 984 states and 3225 transitions. [2025-04-13 22:24:53,889 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:53,889 INFO L278 IsEmpty]: Start isEmpty. Operand 984 states and 3225 transitions. [2025-04-13 22:24:53,890 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:24:53,890 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:53,890 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:53,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Ended with exit code 0 [2025-04-13 22:24:54,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150,142 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:54,090 INFO L403 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:54,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:54,091 INFO L85 PathProgramCache]: Analyzing trace with hash -553740278, now seen corresponding path program 133 times [2025-04-13 22:24:54,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:54,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056679692] [2025-04-13 22:24:54,091 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:24:54,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:54,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:24:54,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:24:54,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:24:54,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:54,711 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:24:54,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:54,711 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056679692] [2025-04-13 22:24:54,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056679692] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:54,711 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519050250] [2025-04-13 22:24:54,711 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:24:54,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:54,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:54,713 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:54,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2025-04-13 22:24:55,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:24:55,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:24:55,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:24:55,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:55,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:24:55,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:55,416 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:24:55,416 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:24:55,438 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:24:55,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:55,621 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:55,621 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 212 [2025-04-13 22:24:56,133 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:24:56,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519050250] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:56,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:56,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 39 [2025-04-13 22:24:56,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781502863] [2025-04-13 22:24:56,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:56,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 22:24:56,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:56,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 22:24:56,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1421, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:24:56,134 INFO L87 Difference]: Start difference. First operand 984 states and 3225 transitions. Second operand has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:03,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:03,522 INFO L93 Difference]: Finished difference Result 1161 states and 3664 transitions. [2025-04-13 22:25:03,522 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 22:25:03,522 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:25:03,522 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:03,525 INFO L225 Difference]: With dead ends: 1161 [2025-04-13 22:25:03,525 INFO L226 Difference]: Without dead ends: 1123 [2025-04-13 22:25:03,525 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1701 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=793, Invalid=6347, Unknown=0, NotChecked=0, Total=7140 [2025-04-13 22:25:03,526 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 199 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:03,526 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 0 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:25:03,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2025-04-13 22:25:06,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1002. [2025-04-13 22:25:06,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 1001 states have (on average 3.2747252747252746) internal successors, (3278), 1001 states have internal predecessors, (3278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 3278 transitions. [2025-04-13 22:25:06,434 INFO L79 Accepts]: Start accepts. Automaton has 1002 states and 3278 transitions. Word has length 30 [2025-04-13 22:25:06,434 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:06,434 INFO L485 AbstractCegarLoop]: Abstraction has 1002 states and 3278 transitions. [2025-04-13 22:25:06,434 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:06,434 INFO L278 IsEmpty]: Start isEmpty. Operand 1002 states and 3278 transitions. [2025-04-13 22:25:06,436 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:25:06,436 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:06,436 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:06,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Ended with exit code 0 [2025-04-13 22:25:06,636 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,143 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:06,636 INFO L403 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:06,636 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:06,636 INFO L85 PathProgramCache]: Analyzing trace with hash -504585128, now seen corresponding path program 134 times [2025-04-13 22:25:06,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:06,637 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922124273] [2025-04-13 22:25:06,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:25:06,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:06,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:25:06,662 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:25:06,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:25:06,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:07,117 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:25:07,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:07,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922124273] [2025-04-13 22:25:07,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922124273] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:07,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588298437] [2025-04-13 22:25:07,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:25:07,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:07,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:07,119 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:25:07,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Waiting until timeout for monitored process [2025-04-13 22:25:07,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:25:07,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:25:07,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:25:07,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:07,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:25:07,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:07,890 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:25:07,890 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:25:07,912 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:25:07,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:08,522 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-13 22:25:08,523 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 195 treesize of output 233 [2025-04-13 22:25:10,316 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:25:10,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588298437] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:10,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:10,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 11] total 35 [2025-04-13 22:25:10,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494012839] [2025-04-13 22:25:10,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:10,317 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 22:25:10,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:10,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 22:25:10,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1123, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:25:10,317 INFO L87 Difference]: Start difference. First operand 1002 states and 3278 transitions. Second operand has 36 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 36 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:22,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:22,623 INFO L93 Difference]: Finished difference Result 1314 states and 3915 transitions. [2025-04-13 22:25:22,624 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-04-13 22:25:22,624 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 36 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:25:22,624 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:22,627 INFO L225 Difference]: With dead ends: 1314 [2025-04-13 22:25:22,627 INFO L226 Difference]: Without dead ends: 1264 [2025-04-13 22:25:22,628 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4302 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1319, Invalid=11337, Unknown=0, NotChecked=0, Total=12656 [2025-04-13 22:25:22,628 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 327 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2247 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:22,628 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 0 Invalid, 2315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2247 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 22:25:22,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2025-04-13 22:25:25,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1016. [2025-04-13 22:25:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 1015 states have (on average 3.2758620689655173) internal successors, (3325), 1015 states have internal predecessors, (3325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 3325 transitions. [2025-04-13 22:25:25,650 INFO L79 Accepts]: Start accepts. Automaton has 1016 states and 3325 transitions. Word has length 30 [2025-04-13 22:25:25,650 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:25,650 INFO L485 AbstractCegarLoop]: Abstraction has 1016 states and 3325 transitions. [2025-04-13 22:25:25,650 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 36 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:25,650 INFO L278 IsEmpty]: Start isEmpty. Operand 1016 states and 3325 transitions. [2025-04-13 22:25:25,651 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:25:25,651 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:25,651 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:25,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Ended with exit code 0 [2025-04-13 22:25:25,851 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152,144 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:25,852 INFO L403 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:25,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:25,852 INFO L85 PathProgramCache]: Analyzing trace with hash -502076918, now seen corresponding path program 135 times [2025-04-13 22:25:25,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:25,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064107350] [2025-04-13 22:25:25,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:25:25,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:25,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:25:25,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:25:25,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:25:25,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:25:26,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:26,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064107350] [2025-04-13 22:25:26,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064107350] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:26,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602475419] [2025-04-13 22:25:26,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:25:26,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:26,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:26,477 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:25:26,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Waiting until timeout for monitored process [2025-04-13 22:25:26,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:25:26,965 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:25:26,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:25:26,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:26,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 22:25:26,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:27,308 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 22:25:27,309 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 22:25:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:25:27,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:28,120 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-13 22:25:28,121 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 225 treesize of output 263 [2025-04-13 22:25:30,747 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:25:30,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602475419] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:30,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:30,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 38 [2025-04-13 22:25:30,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387461469] [2025-04-13 22:25:30,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:30,747 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 22:25:30,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:30,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 22:25:30,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1314, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:25:30,748 INFO L87 Difference]: Start difference. First operand 1016 states and 3325 transitions. Second operand has 39 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 39 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:42,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:42,767 INFO L93 Difference]: Finished difference Result 1258 states and 3824 transitions. [2025-04-13 22:25:42,767 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-04-13 22:25:42,767 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 39 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:25:42,767 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:42,770 INFO L225 Difference]: With dead ends: 1258 [2025-04-13 22:25:42,770 INFO L226 Difference]: Without dead ends: 1235 [2025-04-13 22:25:42,771 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3844 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1243, Invalid=10099, Unknown=0, NotChecked=0, Total=11342 [2025-04-13 22:25:42,771 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 242 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1732 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:42,771 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 0 Invalid, 1826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1732 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:25:42,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2025-04-13 22:25:45,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1014. [2025-04-13 22:25:45,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1013 states have (on average 3.265547877591313) internal successors, (3308), 1013 states have internal predecessors, (3308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:45,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 3308 transitions. [2025-04-13 22:25:45,695 INFO L79 Accepts]: Start accepts. Automaton has 1014 states and 3308 transitions. Word has length 30 [2025-04-13 22:25:45,695 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:45,695 INFO L485 AbstractCegarLoop]: Abstraction has 1014 states and 3308 transitions. [2025-04-13 22:25:45,695 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 39 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:45,695 INFO L278 IsEmpty]: Start isEmpty. Operand 1014 states and 3308 transitions. [2025-04-13 22:25:45,696 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:25:45,696 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:45,696 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:45,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Ended with exit code 0 [2025-04-13 22:25:45,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153,145 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:45,897 INFO L403 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:45,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:45,897 INFO L85 PathProgramCache]: Analyzing trace with hash 475032, now seen corresponding path program 136 times [2025-04-13 22:25:45,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:45,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576475621] [2025-04-13 22:25:45,897 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:25:45,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:45,910 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:25:45,914 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 22:25:45,914 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:25:45,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:25:46,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:46,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576475621] [2025-04-13 22:25:46,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576475621] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:46,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33850873] [2025-04-13 22:25:46,133 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:25:46,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:46,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:46,135 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:25:46,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Waiting until timeout for monitored process [2025-04-13 22:25:46,588 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:25:46,597 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 22:25:46,597 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 22:25:46,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:46,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:25:46,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:46,739 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:25:46,739 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:25:46,759 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:25:46,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:46,882 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:25:46,882 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 191 [2025-04-13 22:25:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:25:47,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33850873] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:47,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:47,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2025-04-13 22:25:47,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352494683] [2025-04-13 22:25:47,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:47,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:25:47,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:47,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:25:47,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:25:47,439 INFO L87 Difference]: Start difference. First operand 1014 states and 3308 transitions. Second operand has 25 states, 24 states have (on average 1.75) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:52,837 INFO L93 Difference]: Finished difference Result 1104 states and 3493 transitions. [2025-04-13 22:25:52,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:25:52,838 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.75) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:25:52,838 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:52,840 INFO L225 Difference]: With dead ends: 1104 [2025-04-13 22:25:52,840 INFO L226 Difference]: Without dead ends: 1089 [2025-04-13 22:25:52,840 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=1900, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:25:52,841 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:52,841 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:25:52,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2025-04-13 22:25:55,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1014. [2025-04-13 22:25:55,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1013 states have (on average 3.261599210266535) internal successors, (3304), 1013 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 3304 transitions. [2025-04-13 22:25:55,807 INFO L79 Accepts]: Start accepts. Automaton has 1014 states and 3304 transitions. Word has length 30 [2025-04-13 22:25:55,807 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:55,807 INFO L485 AbstractCegarLoop]: Abstraction has 1014 states and 3304 transitions. [2025-04-13 22:25:55,807 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.75) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:55,807 INFO L278 IsEmpty]: Start isEmpty. Operand 1014 states and 3304 transitions. [2025-04-13 22:25:55,808 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:25:55,808 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:55,808 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:55,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Ended with exit code 0 [2025-04-13 22:25:56,008 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154,146 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:56,008 INFO L403 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:56,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:56,009 INFO L85 PathProgramCache]: Analyzing trace with hash 489175460, now seen corresponding path program 137 times [2025-04-13 22:25:56,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:56,009 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550483620] [2025-04-13 22:25:56,009 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:25:56,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:56,022 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:25:56,047 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:25:56,047 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:25:56,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:56,484 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 22:25:56,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:56,484 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550483620] [2025-04-13 22:25:56,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550483620] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:56,484 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429958010] [2025-04-13 22:25:56,484 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:25:56,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:56,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:56,486 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:25:56,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Waiting until timeout for monitored process [2025-04-13 22:25:56,944 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:25:57,011 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:25:57,011 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:25:57,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:57,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 22:25:57,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:57,316 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:25:57,316 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 22:25:57,356 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:25:57,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:57,516 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:25:57,516 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 197 [2025-04-13 22:25:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:25:58,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429958010] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:58,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:58,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 11] total 38 [2025-04-13 22:25:58,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039421783] [2025-04-13 22:25:58,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:58,005 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 22:25:58,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:58,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 22:25:58,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1361, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:25:58,006 INFO L87 Difference]: Start difference. First operand 1014 states and 3304 transitions. Second operand has 39 states, 38 states have (on average 1.631578947368421) internal successors, (62), 39 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:04,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:04,423 INFO L93 Difference]: Finished difference Result 1117 states and 3540 transitions. [2025-04-13 22:26:04,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 22:26:04,424 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.631578947368421) internal successors, (62), 39 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:26:04,424 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:04,427 INFO L225 Difference]: With dead ends: 1117 [2025-04-13 22:26:04,427 INFO L226 Difference]: Without dead ends: 1091 [2025-04-13 22:26:04,427 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1251 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=485, Invalid=5521, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 22:26:04,427 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 168 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2111 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:04,427 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 0 Invalid, 2143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2111 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:26:04,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2025-04-13 22:26:07,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1022. [2025-04-13 22:26:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1021 states have (on average 3.265426052889324) internal successors, (3334), 1021 states have internal predecessors, (3334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:07,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 3334 transitions. [2025-04-13 22:26:07,390 INFO L79 Accepts]: Start accepts. Automaton has 1022 states and 3334 transitions. Word has length 30 [2025-04-13 22:26:07,390 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:07,390 INFO L485 AbstractCegarLoop]: Abstraction has 1022 states and 3334 transitions. [2025-04-13 22:26:07,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.631578947368421) internal successors, (62), 39 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:07,390 INFO L278 IsEmpty]: Start isEmpty. Operand 1022 states and 3334 transitions. [2025-04-13 22:26:07,391 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:26:07,391 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:07,391 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:07,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Ended with exit code 0 [2025-04-13 22:26:07,592 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 147 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable155 [2025-04-13 22:26:07,592 INFO L403 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:07,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:07,592 INFO L85 PathProgramCache]: Analyzing trace with hash 540838820, now seen corresponding path program 138 times [2025-04-13 22:26:07,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:07,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503475667] [2025-04-13 22:26:07,592 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:26:07,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:07,605 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:26:07,626 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:26:07,627 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:26:07,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:26:08,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:08,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503475667] [2025-04-13 22:26:08,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503475667] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:08,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285928153] [2025-04-13 22:26:08,099 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:26:08,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:08,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:08,101 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:26:08,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Waiting until timeout for monitored process [2025-04-13 22:26:08,559 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:26:08,588 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:26:08,588 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:26:08,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:08,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:26:08,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:08,778 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:26:08,778 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:26:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:26:08,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:08,916 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:26:08,917 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 22:26:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:26:09,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285928153] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:09,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:09,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 29 [2025-04-13 22:26:09,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781302108] [2025-04-13 22:26:09,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:09,663 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:26:09,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:09,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:26:09,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:26:09,663 INFO L87 Difference]: Start difference. First operand 1022 states and 3334 transitions. Second operand has 30 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:15,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:15,903 INFO L93 Difference]: Finished difference Result 1161 states and 3641 transitions. [2025-04-13 22:26:15,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 22:26:15,903 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:26:15,903 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:15,906 INFO L225 Difference]: With dead ends: 1161 [2025-04-13 22:26:15,906 INFO L226 Difference]: Without dead ends: 1134 [2025-04-13 22:26:15,906 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=424, Invalid=3608, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 22:26:15,906 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 135 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:15,907 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 0 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:26:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2025-04-13 22:26:18,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1022. [2025-04-13 22:26:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1021 states have (on average 3.2634671890303624) internal successors, (3332), 1021 states have internal predecessors, (3332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:18,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 3332 transitions. [2025-04-13 22:26:18,884 INFO L79 Accepts]: Start accepts. Automaton has 1022 states and 3332 transitions. Word has length 30 [2025-04-13 22:26:18,884 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:18,884 INFO L485 AbstractCegarLoop]: Abstraction has 1022 states and 3332 transitions. [2025-04-13 22:26:18,884 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:18,884 INFO L278 IsEmpty]: Start isEmpty. Operand 1022 states and 3332 transitions. [2025-04-13 22:26:18,885 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:26:18,885 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:18,885 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:18,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Ended with exit code 0 [2025-04-13 22:26:19,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 148 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable156 [2025-04-13 22:26:19,086 INFO L403 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:19,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:19,086 INFO L85 PathProgramCache]: Analyzing trace with hash -674952936, now seen corresponding path program 139 times [2025-04-13 22:26:19,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:19,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986026418] [2025-04-13 22:26:19,086 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:26:19,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:19,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:26:19,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:26:19,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:26:19,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:19,649 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:26:19,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:19,649 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986026418] [2025-04-13 22:26:19,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986026418] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:19,649 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210666271] [2025-04-13 22:26:19,649 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:26:19,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:19,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:19,651 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:26:19,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Waiting until timeout for monitored process [2025-04-13 22:26:20,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:26:20,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:26:20,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:26:20,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:20,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:26:20,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:20,360 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:26:20,360 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 22:26:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:26:20,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:20,523 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:26:20,523 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 210 treesize of output 206 [2025-04-13 22:26:21,236 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:26:21,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210666271] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:21,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:21,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 39 [2025-04-13 22:26:21,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679090585] [2025-04-13 22:26:21,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:21,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 22:26:21,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:21,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 22:26:21,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1426, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:26:21,237 INFO L87 Difference]: Start difference. First operand 1022 states and 3332 transitions. Second operand has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:28,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:28,032 INFO L93 Difference]: Finished difference Result 1155 states and 3626 transitions. [2025-04-13 22:26:28,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-13 22:26:28,032 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:26:28,032 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:28,035 INFO L225 Difference]: With dead ends: 1155 [2025-04-13 22:26:28,035 INFO L226 Difference]: Without dead ends: 1133 [2025-04-13 22:26:28,036 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=632, Invalid=6340, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 22:26:28,036 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 194 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1768 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:28,036 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 0 Invalid, 1807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1768 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:26:28,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2025-04-13 22:26:31,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1032. [2025-04-13 22:26:31,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 1031 states have (on average 3.265761396702231) internal successors, (3367), 1031 states have internal predecessors, (3367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:31,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 3367 transitions. [2025-04-13 22:26:31,101 INFO L79 Accepts]: Start accepts. Automaton has 1032 states and 3367 transitions. Word has length 30 [2025-04-13 22:26:31,101 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:31,101 INFO L485 AbstractCegarLoop]: Abstraction has 1032 states and 3367 transitions. [2025-04-13 22:26:31,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:31,102 INFO L278 IsEmpty]: Start isEmpty. Operand 1032 states and 3367 transitions. [2025-04-13 22:26:31,103 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:26:31,103 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:31,103 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:31,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Ended with exit code 0 [2025-04-13 22:26:31,303 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 149 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable157 [2025-04-13 22:26:31,303 INFO L403 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:31,303 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:31,303 INFO L85 PathProgramCache]: Analyzing trace with hash -672444726, now seen corresponding path program 140 times [2025-04-13 22:26:31,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:31,303 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624410212] [2025-04-13 22:26:31,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:26:31,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:31,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:26:31,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:26:31,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:26:31,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:31,828 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:26:31,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:31,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624410212] [2025-04-13 22:26:31,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624410212] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:31,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869954467] [2025-04-13 22:26:31,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:26:31,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:31,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:31,830 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:26:31,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Waiting until timeout for monitored process [2025-04-13 22:26:32,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:26:32,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:26:32,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:26:32,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:32,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:26:32,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:32,691 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:26:32,692 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 22:26:32,719 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:26:32,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:32,842 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:26:32,842 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 22:26:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:26:33,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869954467] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:33,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:33,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 11] total 40 [2025-04-13 22:26:33,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589242112] [2025-04-13 22:26:33,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:33,578 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 22:26:33,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:33,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 22:26:33,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1500, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:26:33,578 INFO L87 Difference]: Start difference. First operand 1032 states and 3367 transitions. Second operand has 41 states, 40 states have (on average 1.725) internal successors, (69), 41 states have internal predecessors, (69), 0 states have call successors, (0), 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 22:26:34,285 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 22:26:34,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:26:34,289 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=2581, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:26:34,289 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:34,289 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 0 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:26:34,290 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 22:26:34,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Ended with exit code 0 [2025-04-13 22:26:34,328 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 22:26:34,490 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 150 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable158 [2025-04-13 22:26:34,490 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (1032states) and FLOYD_HOARE automaton (currently 18 states, 41 states before enhancement),while ReachableStatesComputation was computing reachable states (139 states constructed, input type IntersectNwa). [2025-04-13 22:26:34,492 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 22:26:34,492 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 22:26:34,493 INFO L422 BasicCegarLoop]: Path program histogram: [140, 8, 6, 4, 1] [2025-04-13 22:26:34,495 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:26:34,495 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:26:34,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:26:34 BasicIcfg [2025-04-13 22:26:34,497 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:26:34,497 INFO L158 Benchmark]: Toolchain (without parser) took 849509.08ms. Allocated memory was 155.2MB in the beginning and 872.4MB in the end (delta: 717.2MB). Free memory was 109.4MB in the beginning and 480.4MB in the end (delta: -371.0MB). Peak memory consumption was 720.4MB. Max. memory is 8.0GB. [2025-04-13 22:26:34,497 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:26:34,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.49ms. Allocated memory is still 155.2MB. Free memory was 109.4MB in the beginning and 94.2MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 22:26:34,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.71ms. Allocated memory is still 155.2MB. Free memory was 94.2MB in the beginning and 92.4MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:26:34,497 INFO L158 Benchmark]: Boogie Preprocessor took 45.82ms. Allocated memory is still 155.2MB. Free memory was 92.4MB in the beginning and 90.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:26:34,497 INFO L158 Benchmark]: IcfgBuilder took 525.05ms. Allocated memory is still 155.2MB. Free memory was 90.7MB in the beginning and 32.8MB in the end (delta: 57.8MB). Peak memory consumption was 58.7MB. Max. memory is 8.0GB. [2025-04-13 22:26:34,497 INFO L158 Benchmark]: TraceAbstraction took 848662.25ms. Allocated memory was 155.2MB in the beginning and 872.4MB in the end (delta: 717.2MB). Free memory was 32.0MB in the beginning and 480.4MB in the end (delta: -448.4MB). Peak memory consumption was 644.9MB. Max. memory is 8.0GB. [2025-04-13 22:26:34,497 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.16ms. Allocated memory is still 159.4MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.49ms. Allocated memory is still 155.2MB. Free memory was 109.4MB in the beginning and 94.2MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.71ms. Allocated memory is still 155.2MB. Free memory was 94.2MB in the beginning and 92.4MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.82ms. Allocated memory is still 155.2MB. Free memory was 92.4MB in the beginning and 90.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 525.05ms. Allocated memory is still 155.2MB. Free memory was 90.7MB in the beginning and 32.8MB in the end (delta: 57.8MB). Peak memory consumption was 58.7MB. Max. memory is 8.0GB. * TraceAbstraction took 848662.25ms. Allocated memory was 155.2MB in the beginning and 872.4MB in the end (delta: 717.2MB). Free memory was 32.0MB in the beginning and 480.4MB in the end (delta: -448.4MB). Peak memory consumption was 644.9MB. 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: 93]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (1032states) and FLOYD_HOARE automaton (currently 18 states, 41 states before enhancement),while ReachableStatesComputation was computing reachable states (139 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (1032states) and FLOYD_HOARE automaton (currently 18 states, 41 states before enhancement),while ReachableStatesComputation was computing reachable states (139 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (1032states) and FLOYD_HOARE automaton (currently 18 states, 41 states before enhancement),while ReachableStatesComputation was computing reachable states (139 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 26 locations, 31 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 848.6s, OverallIterations: 159, TraceHistogramMax: 5, PathProgramHistogramMax: 140, EmptinessCheckTime: 0.1s, AutomataDifference: 442.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24017 SdHoareTripleChecker+Valid, 64.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24017 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 55.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4358 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 162873 IncrementalHoareTripleChecker+Invalid, 167231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4358 mSolverCounterUnsat, 0 mSDtfsCounter, 162873 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16674 GetRequests, 8240 SyntacticMatches, 14 SemanticMatches, 8420 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164482 ImplicationChecksByTransitivity, 175.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1032occurred in iteration=158, InterpolantAutomatonStates: 5510, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 121.3s AutomataMinimizationTime, 158 MinimizatonAttempts, 14781 StatesRemovedByMinimization, 154 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.0s SsaConstructionTime, 6.7s SatisfiabilityAnalysisTime, 208.3s InterpolantComputationTime, 8635 NumberOfCodeBlocks, 7696 NumberOfCodeBlocksAsserted, 715 NumberOfCheckSat, 12358 ConstructedInterpolants, 0 QuantifiedInterpolants, 150104 SizeOfPredicates, 3808 NumberOfNonLiveVariables, 34914 ConjunctsInSsa, 4019 ConjunctsInUnsatCore, 456 InterpolantComputations, 11 PerfectInterpolantSequences, 12333/17702 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